Clique-Colouring and Biclique-Colouring Unichord-Free Graphs

DOI10.1007/978-3-642-29344-3_45zbMath1354.05052OpenAlexW55740500MaRDI QIDQ2894495

Celina M. H. Figueiredo, Raphael C. S. Machado, Hélio B. Macêdo Filho

Publication date: 29 June 2012

Published in: LATIN 2012: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29344-3_45

zbMATH Keywords

decompositionhypergraphsPetersen graphcactusbiclique colouringclique colouringunichord-free graphHeawood graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3 ⋮ On star and biclique edge-colorings ⋮ Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs

This page was built for publication: Clique-Colouring and Biclique-Colouring Unichord-Free Graphs