Relaxed two-coloring of cubic graphs

zbMATH Open1192.05045MaRDI QIDQ3576715FDOQ3576715

Authors: Robert Berke, Tibor Szabó 

Publication date: 30 July 2010

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAE0166/0.html

Recommendations

• Relaxed two-coloring of cubic graphs
• Deciding Relaxed Two-Colorability—A Hardness Jump
• Deciding Relaxed Two-Colourability: A Hardness Jump
• Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5

zbMATH Keywords

vertex coloringbounded size components

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (2)

• Deciding Relaxed Two-Colorability—A Hardness Jump
• Relaxed two-coloring of cubic graphs

This page was built for publication: Relaxed two-coloring of cubic graphs

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