On the chromatic number of (P₆, diamond)-free graphs
From MaRDI portal
Publication:2413634
Recommendations
- THE CHROMATIC NUMBER OF -FREE GRAPHS
- An optimal χ‐bound for (P6, diamond)‐free graphs
- On minimal triangle-free 6-chromatic graphs
- scientific article; zbMATH DE number 1880734
- 4-colorability of P₆-free graphs
- Four-coloring \(P_6\)-free graphs
- On chromatic uniqueness of certain 6-partite graphs
- A New Characterization of P 6-Free Graphs
- A new characterization of \(P_{6}\)-free graphs
- Total dominations in \(P_6\)-free graphs
Cites work
- scientific article; zbMATH DE number 5761816 (Why is no real title available?)
- scientific article; zbMATH DE number 2044943 (Why is no real title available?)
- scientific article; zbMATH DE number 4183452 (Why is no real title available?)
- 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.
- A survey on the computational complexity of coloring graphs with forbidden subgraphs
- Algorithmic graph theory and perfect graphs
- Bisimplicial vertices in even-hole-free graphs
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- Coloring perfect \((K_ 4\)-e)-free graphs
- Coloring the hypergraph of maximal cliques of a graph with no long path
- Colouring diamond-free graphs
- Colouring of \((P_3 \cup P_2)\)-free graphs
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
- Forbidden subgraphs and 3-colorings
- Hereditary graph classes: When the complexities of <scp>coloring</scp> and <scp>clique cover</scp> coincide
- Improved complexity results on \(k\)-coloring \(P_t\)-free graphs
- Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs
- Obstructions for three-coloring graphs with one forbidden induced subgraph
- Perfect coloring and linearly χ-boundP6-free graphs
- Reducibility among combinatorial problems
- Sur le coloriage des graphs
- The chromatic number of \(\{P_5,K_4\}\)-free graphs
- The strong perfect graph theorem
- Three-colourability and forbidden subgraphs. II: Polynomial algorithms
- Triangle-free \(2P_3\)-free graphs are 4-colorable
- Triangle-free graphs and forbidden subgraphs
- Updating the complexity status of coloring graphs without a fixed induced linear forest
- Vertex colouring and forbidden subgraphs -- a survey
- Vizing bound for the chromatic number on some graph classes
- \(K_{4}\)-free graphs with no odd holes
Cited in
(11)- Linear χ -binding functions for some classes of ( P 3 ∪ P 2 )-free graphs
- THE CHROMATIC NUMBER OF -FREE GRAPHS
- Colouring graphs with no induced six-vertex path or diamond
- Colouring graphs with no induced six-vertex path or diamond
- Strong cliques in diamond-free graphs
- An optimal χ‐bound for (P6, diamond)‐free graphs
- scientific article; zbMATH DE number 1880734 (Why is no real title available?)
- Improved bounds on the chromatic number of (\(P_5\), flag)-free graphs
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- On chromatic number of \(\{2K_1+K_2,C_4\}\)-free graphs
- Vizing bound for the chromatic number on some graph classes
This page was built for publication: On the chromatic number of (\(P_6\), diamond)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2413634)
