Decomposing and clique-coloring (diamond, odd-hole)-free graphs
DOI10.1002/JGT.22110zbMATH Open1370.05060OpenAlexW2567596596MaRDI QIDQ5360874FDOQ5360874
Authors: Maria Chudnovsky, Irene Lo 
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
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)
Cited In (18)
- A linear-time algorithm for clique-coloring planar graphs
- List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly
- Perfect graphs of arbitrarily large clique-chromatic number
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- Complexity of clique-coloring odd-hole-free graphs
- Title not available (Why is that?)
- Clique-coloring some classes of odd-hole-free graphs
- Colouring diamond-free graphs
- Recognition algorithm for diamond-free graphs
- Equitable clique-coloring in claw-free graphs with maximum degree at most 4
- \(K_{4}\)-free graphs with no odd holes
- Title not available (Why is that?)
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs
- Complexity-separating graph classes for vertex, edge and total colouring
- Structural parameterizations of clique coloring
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5360874)
