Graphs with girth 9 and without longer odd holes are 3-colourable

DOI10.1002/JGT.23101zbMATH Open1542.05061MaRDI QIDQ6565814

Yan Wang, Rong Wu

Publication date: 2 July 2024

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

zbMATH Keywords

colouringinduced subgraphodd hole

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Induced subgraphs of graphs with large chromatic number. I. Odd holes
• On a conjecture concerning the Petersen graph. II
• On a conjecture concerning the Petersen graph
• The strong perfect graph theorem
• Bisimplicial vertices in even-hole-free graphs
• A note on chromatic number and induced odd cycles
• Some problems on induced subgraphs
• A survey of χ‐boundedness
• On the divisibility of graphs
• Even-hole-free graphs still have bisimplicial vertices
• Proof of a conjecture of Plummer and Zha

This page was built for publication: Graphs with girth 9 and without longer odd holes are 3-colourable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565814)