2-divisibility of some odd hole free graphs
From MaRDI portal
Publication:2155661
Recommendations
Cites work
- \(K_{4}\)-free graphs with no odd holes
- A survey of -boundedness
- scientific article; zbMATH DE number 3480625 (Why is no real title available?)
- Induced subgraphs of graphs with large chromatic number. I. Odd holes
- Maximum weight independent sets in odd-hole-free graphs without dart or without bull
- On the divisibility of graphs
- On the structure of (banner, odd hole)-free graphs
- Perfect divisibility and 2‐divisibility
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
- Some problems on induced subgraphs
- The strong perfect graph theorem
Cited in
(6)- scientific article; zbMATH DE number 1439504 (Why is no real title available?)
- Perfect divisibility and coloring of some fork-free graphs
- On the chromatic number of a family of odd hole free graphs
- On the structure of perfectly divisible graphs
- On the structure of some classes of (P₂ P₃)-free graphs
- On the structure of (dart, odd hole)-free graphs
This page was built for publication: 2-divisibility of some odd hole free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2155661)