K4-free graphs with no odd hole: Even pairs and the circular chromatic number
From MaRDI portal
Publication:3061190
DOI10.1002/jgt.20482zbMath1207.05102OpenAlexW4256269995WikidataQ114236184 ScholiaQ114236184MaRDI QIDQ3061190
Publication date: 14 December 2010
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20482
Related Items (2)
Three-colourable perfect graphs without even pairs ⋮ A faster algorithm to recognize even-hole-free graphs
Cites Work
This page was built for publication: K4-free graphs with no odd hole: Even pairs and the circular chromatic number