19 citations · 69 across the 16 of their papers we have counts for
3 papers · 1 filter
Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3
Hélio B. Macêdo Filho, Raphael C. S. Machado, Celina M. H. de Figueiredo
A clique of a graph is a maximal set of vertices of size at least 2 that induces a complete graph. A -clique-colouring of a graph is a colouring of the vertices with at most …
Complexity of colouring problems restricted to unichord-free and \{square,unichord\}-free graphs
Raphael C. S. Machado, Celina M. H. de Figueiredo, Nicolas Trotignon
A \emph{unichord} in a graph is an edge that is the unique chord of a cycle. A \emph{square} is an induced cycle on four vertices. A graph is \emph{unichord-free} if none of its ed…
Edge-colouring and total-colouring chordless graphs
Raphael C. S. Machado, Celina M. H. de Figueiredo, Nicolas Trotignon
A graph is \emph{chordless} if no cycle in has a chord. In the present work we investigate the chromatic index and total chromatic number of chordless graphs. We describe a…