Complexity of clique-coloring odd-hole-free graphs

From MaRDI portal
Publication:3652547

DOI10.1002/jgt.20387zbMath1182.05092OpenAlexW4251123531MaRDI QIDQ3652547

David Défossez

Publication date: 18 December 2009

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

Full work available at URL: https://doi.org/10.1002/jgt.20387




Related Items (17)



Cites Work


This page was built for publication: Complexity of clique-coloring odd-hole-free graphs