Peter Maceli

activity

20132018

most citedThree-coloring graphs with no induced seven-vertex path II : using a triangle

17 citations · 56 across the 8 of their papers we have counts for

collaborators

Showing 2013 · math.COShow all

2 papers · 2 filters

math.CO2013★ 3 cited

Excluding four-edge paths and their complements

Maria Chudnovsky, Peter Maceli, Irena Penev

We prove that a graph G contains no induced four-edge path and no induced complement of a four-edge path if and only if G is obtained from five-cycles and split graphs by repeatedl…

math.CO2013

Simplicial vertices in graphs with no induced four-edge path or four-edge antipath, and the $H_{6}$ -conjecture

Maria Chudnovsky, Peter Maceli

Let $G$ be the class of all graphs with no induced four-edge path or four-edge antipath. Hayward and Nastos \cite{MS} conjectured that every prime graph in $G$ …

Excluding four-edge paths and their complements

Simplicial vertices in graphs with no induced four-edge path or four-edge antipath, and the H6​-conjecture

Simplicial vertices in graphs with no induced four-edge path or four-edge antipath, and the $H_{6}$ -conjecture