Chromatic bounds for some subclasses of \((P_3\cup P_2)\)-free graphs

DOI10.1007/978-3-030-95018-7_2arXiv2203.06423OpenAlexW4206930753MaRDI QIDQ6102260

No author found.

Publication date: 8 May 2023

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.06423

zbMATH Keywords

chromatic numberperfect graphs\( \chi \)-binding function\((P_3\cup P_2)\)-free graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Coloring of a superclass of \(2K_2\)-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Chromatic bounds for the subclasses of \(pK_2\)-free graphs
• The strong perfect graph theorem
• Paw-free graphs
• 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
• Chromatic bounds for some classes of \(2 K_2\)-free graphs

This page was built for publication: Chromatic bounds for some subclasses of \((P_3\cup P_2)\)-free graphs