Clique-coloring claw-free graphs
From MaRDI portal
Publication:2631088
DOI10.1007/s00373-015-1657-8zbMath1343.05064OpenAlexW2254075100MaRDI QIDQ2631088
Erfang Shan, Zuosong Liang, Li-ying Kang
Publication date: 28 July 2016
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-015-1657-8
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Clique-coloring of \(K_{3,3}\)-minor free graphs, Equitable clique-coloring in claw-free graphs with maximum degree at most 4, Clique colourings of geometric graphs, HIGH-ORDER COPOSITIVE TENSORS AND ITS APPLICATIONS, A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs, A linear-time algorithm for clique-coloring planar graphs, List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly, Clique chromatic numbers of intersection graphs, On the complexity of local-equitable coloring of graphs, A generalization of Grötzsch Theorem on the local-equitable coloring
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity of clique coloring and related problems
- Clique-transversal sets of line graphs and complements of line graphs
- Claw-free graphs. III: Circular interval graphs
- Claw-free graphs. IV: Decomposition theorem
- Chains, antichains, and fibres
- Fibres and ordered set coloring
- The Grötzsch theorem for the hypergraph of maximal cliques
- Clique-transversal sets and clique-coloring in planar graphs
- Clique-Coloring Circular-Arc Graphs
- Clique-coloring some classes of odd-hole-free graphs
- Clique-coloring UE and UEH graphs
- Complexity of clique-coloring odd-hole-free graphs
- Coloring the Maximal Cliques of Graphs
- On the complexity of bicoloring clique hypergraphs of graphs
- Colouring clique-hypergraphs of circulant graphs
- On the divisibility of graphs
