Perfect divisibility and coloring of some fork-free graphs

DOI10.1016/j.disc.2024.114121zbMATH Open1543.05063MaRDI QIDQ6570043

Bao-Gang Xu, Di Wu

Publication date: 10 July 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

chromatic numberforkperfect divisibility

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Claw-free graphs. VI: Colouring
• Square-free graphs with no induced fork
• The strong perfect graph theorem
• On the chromatic number of \(2 K_2\)-free graphs
• Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
• Vertex colouring and forbidden subgraphs -- a survey
• Coloring graph classes with no induced fork via perfect divisibility
• Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions
• Excluding the fork and antifork
• Radius two trees specify χ‐bounded classes
• On the structure of (banner, odd hole)‐free graphs
• The Ramsey number R(3, t) has order of magnitude t²/log t
• A survey of χ‐boundedness
• Perfect divisibility and 2‐divisibility
• Coloring of some crown-free graphs
• Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs

This page was built for publication: Perfect divisibility and coloring of some fork-free graphs