Coloring of some crown-free graphs
From MaRDI portal
Publication:6063283
DOI10.1007/s00373-023-02705-0zbMath1526.05053OpenAlexW4386069104MaRDI QIDQ6063283
No author found.
Publication date: 7 November 2023
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-023-02705-0
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Claw-free graphs. VI: Colouring
- The strong perfect graph theorem
- A bound on the chromatic number of graphs without certain induced subgraphs
- On the chromatic number of \(2 K_2\)-free graphs
- Colouring of \((P_3 \cup P_2)\)-free graphs
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- Vertex colouring and forbidden subgraphs -- a survey
- On the chromatic number of some \(P_5\)-free graphs
- Coloring graph classes with no induced fork via perfect divisibility
- Graph Theory and Probability
- Perfect coloring and linearly χ-boundP6-free graphs
- On the structure of (banner, odd hole)‐free graphs
- The Ramsey number R(3, t) has order of magnitude t2/log t
- A survey of χ‐boundedness
- Polynomial bounds for chromatic number. IV: A near-polynomial bound for excluding the five-vertex path
- Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs
This page was built for publication: Coloring of some crown-free graphs
