Clique-transversal sets and clique-coloring in planar graphs
From MaRDI portal
Publication:2441644
DOI10.1016/j.ejc.2013.08.003zbMath1284.05075OpenAlexW2056959228MaRDI QIDQ2441644
Zuosong Liang, Erfang Shan, Li-ying Kang
Publication date: 25 March 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2013.08.003
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Transversal (matching) theory (05D15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Clique-coloring of \(K_{3,3}\)-minor free graphs ⋮ Structural parameterizations of clique coloring ⋮ Clique-coloring claw-free graphs ⋮ Total coloring of claw-free planar graphs ⋮ The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs ⋮ Equitable clique-coloring in claw-free graphs with maximum degree at most 4 ⋮ Inapproximability of $H$-Transversal/Packing ⋮ Clique colourings of geometric graphs ⋮ Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\) ⋮ A linear-time algorithm for clique-coloring problem in circular-arc 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 ⋮ The clique-perfectness and clique-coloring of outer-planar graphs ⋮ A generalization of Grötzsch Theorem on the local-equitable coloring
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximum \(h\)-colourable subgraph problem in balanced graphs
- Complexity of clique coloring and related problems
- Clique-transversal sets of line graphs and complements of line graphs
- Bounds on the clique-transversal number of regular graphs
- 2-list-coloring planar graphs without monochromatic triangles
- The \(\langle t \rangle \)-property of some classes of graphs
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- Chains, antichains, and fibres
- Covering all cliques of a graph
- Fibres and ordered set coloring
- Covering the cliques of a graph with vertices
- The Grötzsch theorem for the hypergraph of maximal cliques
- Extending matchings in claw-free graphs
- On the clique-transversal number of chordal graphs
- On clique-transversals and clique-independent sets
- On covering all cliques of a chordal graph
- Algorithmic aspects of clique-transversal and clique-independent sets
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
- Distance-hereditary graphs are clique-perfect
- Clique-coloring some classes of odd-hole-free graphs
- Complexity of clique-coloring odd-hole-free graphs
- Coloring the Maximal Cliques of Graphs
- On the complexity of bicoloring clique hypergraphs of graphs
- Algorithmic Aspects of Neighborhood Numbers
- On the divisibility of graphs
This page was built for publication: Clique-transversal sets and clique-coloring in planar graphs
