Optimal chromatic bound for (P2+P3,P2+P3¯ ${P}_{2}+{P}_{3},\bar{{P}_{2}+{P}_{3}}$)‐free graphs

DOI10.1002/jgt.23009arXiv2205.07447OpenAlexW4385239666MaRDI QIDQ6143379

Arnab Char, Unnamed Author

Publication date: 24 January 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

chromatic numberclique numbervertex coloring\(\chi\)-boundednessself-complementary graph classes

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Three-colourability and forbidden subgraphs. II: Polynomial algorithms
• Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
• On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
• Excluding the fork and antifork
• A characterization of perfect graphs
• Coloring (gem, co‐gem)‐free graphs
• A survey of χ‐boundedness
• Induced subgraphs of graphs with large chromatic number. XII. Distant stars
• Square-Free Graphs with No Six-Vertex Induced Path
• On graphs with no induced five‐vertex path or paraglider
• An optimal χ‐bound for (P6, diamond)‐free graphs

This page was built for publication: Optimal chromatic bound for (P2+P3,P2+P3¯ ${P}_{2}+{P}_{3},\bar{{P}_{2}+{P}_{3}}$)‐free graphs