A linear-time algorithm for clique-coloring problem in circular-arc graphs
From MaRDI portal
Publication:512872
DOI10.1007/s10878-015-9941-3zbMath1358.05110OpenAlexW1084827881MaRDI QIDQ512872
Zuosong Liang, Erfang Shan, Yu-Zhong Zhang
Publication date: 3 March 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9941-3
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (6)
Equitable clique-coloring in claw-free graphs with maximum degree at most 4 ⋮ HIGH-ORDER COPOSITIVE TENSORS AND ITS APPLICATIONS ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity of clique coloring and related problems
- Linear-time recognition of Helly circular-arc models and graphs
- Eduard Helly (1884-1943), in memoriam
- Clique-transversal sets of line graphs and complements of line graphs
- 2-list-coloring planar graphs without monochromatic triangles
- Fibres and ordered set coloring
- The Grötzsch theorem for the hypergraph of maximal cliques
- Algorithmic graph theory and perfect graphs
- Clique-transversal sets and clique-coloring in planar graphs
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- 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
- Algorithmic Aspects of Vertex Elimination on Graphs
- Coloring the Maximal Cliques of Graphs
- On the complexity of bicoloring clique hypergraphs of graphs
- Characterizing circular-arc graphs
- Colouring clique-hypergraphs of circulant graphs
- On the divisibility of graphs
This page was built for publication: A linear-time algorithm for clique-coloring problem in circular-arc graphs
