Peter Maceli

According to our database, Peter Maceli authored at least 12 papers between 2013 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2021

Better 3-coloring algorithms: Excluding a triangle and a seven vertex path.

Flavia Bonomo-Braberman, Maria Chudnovsky, Jan Goedgebeur, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong

Theor. Comput. Sci., 2021

2020

Coloring graphs with no induced five-vertex path or gem.

Maria Chudnovsky, T. Karthick, Peter Maceli, Frédéric Maffray

J. Graph Theory, 2020

2018

Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices.

Flavia Bonomo, Maria Chudnovsky, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong

Comb., 2018

2017

4-Coloring <i>P</i>₆-Free Graphs with No Induced 5-Cycles.

Maria Chudnovsky, Peter Maceli, Juraj Stacho, Mingxian Zhong

J. Graph Theory, 2017

Graphs with No Induced Five-Vertex Path or Antipath.

Maria Chudnovsky, Louis Esperet, Laetitia Lemoine, Peter Maceli, Frédéric Maffray, Irena Penev

J. Graph Theory, 2017

2015

Excluding Induced Paths: Graph Structure and Coloring.

Peter Maceli

PhD thesis, 2015

Three-coloring graphs with no induced seven-vertex path II : using a triangle.

Maria Chudnovsky, Peter Maceli, Mingxian Zhong

CoRR, 2015

2014

Simplicial Vertices in Graphs with no Induced Four-Edge Path or Four-Edge Antipath, and the <i>H</i>₆-Conjecture.

Maria Chudnovsky, Peter Maceli

J. Graph Theory, 2014

Three-coloring graphs with no induced seven-vertex path I : the triangle-free case.

Maria Chudnovsky, Peter Maceli, Mingxian Zhong

CoRR, 2014

4-coloring $P_6$-free graphs with no induced 5-cycles.

Maria Chudnovsky, Peter Maceli, Juraj Stacho, Mingxian Zhong

CoRR, 2014

2013

Excluding four-edge paths and their complements

Maria Chudnovsky, Peter Maceli, Irena Penev

CoRR, 2013

Ups and downs of the 4-edge path

Maria Chudnovsky, Peter Maceli

CoRR, 2013