Divisibility and coloring of some \(P_5\)-free graphs
From MaRDI portal
Publication:6124429
DOI10.1016/j.dam.2024.01.024MaRDI QIDQ6124429
Publication date: 27 March 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)
Cites Work
- Unnamed Item
- Chromatic number of \(P_5\)-free graphs: Reed's conjecture
- Induced subgraphs of graphs with large chromatic number. I. Odd holes
- The strong perfect graph theorem
- Recognizing claw-free perfect graphs
- On the chromatic number of \(2 K_2\)-free graphs
- Some problems on induced subgraphs
- On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
- The chromatic number of \(\{P_5,K_4\}\)-free graphs
- Coloring of \((P_5, 4\)-wheel)-free graphs
- On the chromatic number of some \(P_5\)-free graphs
- Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions
- A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs
- Perfect coloring and linearly χ-boundP6-free graphs
- On the structure of (banner, odd hole)‐free graphs
- A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS
- Perfect divisibility and 2‐divisibility
- On the divisibility of graphs
- Two cases of polynomial-time solvability for the coloring problem
- On graphs with no induced five‐vertex path or paraglider
- Polynomial bounds for chromatic number. IV: A near-polynomial bound for excluding the five-vertex path
- Coloring graphs with no induced five‐vertex path or gem
This page was built for publication: Divisibility and coloring of some \(P_5\)-free graphs
