Graphs without a 3-connected subgraph are 4-colorable

MaRDI QIDQ6521084arXivFDO

Authors Édouard Bonnet, Carl Feghali, Stéphan Thomassé, Nicolas Trotignon

Published in arXiv

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

This page was built for publication: Graphs without a 3-connected subgraph are 4-colorable

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