Decomposing and Clique‐Coloring (Diamond, Odd‐Hole)‐Free Graphs

DOI10.1002/jgt.22110zbMath1370.05060OpenAlexW2567596596MaRDI QIDQ5360874

Irene Lo, Maria Chudnovsky

Publication date: 26 September 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22110

zbMATH Keywords

perfect graphsdiamond-free graphsodd-hole-free graphsclique-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (10)

Structural parameterizations of clique coloring ⋮ Equitable clique-coloring in claw-free graphs with maximum degree at most 4 ⋮ Complexity-separating graph classes for vertex, edge and total colouring ⋮ Perfect graphs of arbitrarily large clique-chromatic number ⋮ Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs ⋮ Unnamed Item ⋮ A linear-time algorithm for clique-coloring planar graphs ⋮ List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly ⋮ On the complexity of local-equitable coloring of graphs ⋮ A generalization of Grötzsch Theorem on the local-equitable coloring

This page was built for publication: Decomposing and Clique‐Coloring (Diamond, Odd‐Hole)‐Free Graphs