Characterizations of \((4 K_1,C_4,C_5)\)-free graphs
From MaRDI portal
Publication:2403803
DOI10.1016/j.dam.2016.08.016zbMath1369.05075OpenAlexW2585451022MaRDI QIDQ2403803
Dallas J. Fraser, Kevin Holmes, Tom P. Lamantia, Chính T. Hoàng, Angèle M. Hamel
Publication date: 12 September 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.08.016
Related Items (9)
Vertex coloring \((4K_1\), hole-twin, 5-wheel)-free graphs ⋮ The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable ⋮ Complete complexity dichotomy for $7$-edge forbidden subgraphs in the edge coloring problem ⋮ Efficient solvability of the weighted vertex coloring problem for some two hereditary graph classes ⋮ Clique‐width: Harnessing the power of atoms ⋮ On the clique-width of \(( 4 K_1 , C_4 , C_5 , C_7 )\)-free graphs ⋮ The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs ⋮ The intersection of two vertex coloring problems ⋮ $(2P_2,K_4)$-Free Graphs are 4-Colorable
Cites Work
- Unnamed Item
- Unnamed Item
- Vertex coloring of graphs with few obstructions
- On rigid circuit graphs
- Topics on perfect graphs
- The strong perfect graph theorem
- MSOL partitioning problems on graphs of bounded treewidth and clique-width
- Upper bounds to the clique width of graphs
- Clique-width for 4-vertex forbidden subgraphs
- Line graphs of bounded clique-width
- Normal hypergraphs and the perfect graph conjecture
- Graph Classes: A Survey
- On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
This page was built for publication: Characterizations of \((4 K_1,C_4,C_5)\)-free graphs
