On the chromatic number of a family of odd hole free graphs
From MaRDI portal
Publication:6670771
DOI10.12386/a20230017MaRDI QIDQ6670771
Publication date: 24 January 2025
Published in: Acta Mathematica Sinica. Chinese Series (Search for Journal in Brave)
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
- Induced subgraphs of graphs with large chromatic number. I. Odd holes
- Neighbor sum distinguishing edge coloring of subcubic graphs
- The strong perfect graph theorem
- Bisimplicial vertices in even-hole-free graphs
- \(K_{4}\)-free graphs with no odd holes
- Structure and algorithms for (cap, even hole)-free graphs
- A note on chromatic number of (cap, even hole)-free graphs
- A note on strong edge coloring of sparse graphs
- Vertex colouring and forbidden subgraphs -- a survey
- Acyclic edge coloring of graphs with large girths
- A better upper bound on the chromatic number of (cap, even-hole)-free graphs
- 2-divisibility of some odd hole free graphs
- Upper bounds on list star chromatic index of sparse graphs
- Every toroidal graph is acyclically 8-choosable
- On the structure of (banner, odd hole)‐free graphs
- A Lebesgue's type theorem on toroidal graphs and its application to linear coloring
- A result on the optimal binding function of odd signable graphs
- A survey of χ‐boundedness
- Perfect divisibility and 2‐divisibility
- On the divisibility of graphs
- Even-hole-free graphs still have bisimplicial vertices
This page was built for publication: On the chromatic number of a family of odd hole free graphs
