Complexity of the oriented coloring in planar, cubic oriented graphs

DOI10.21711/231766362015/RMC4421MaRDI QIDQ6489463FDO

Authors Hebert Coelho, Luerbio Faria, Sylvain Gravier, Sulamita Klein

Publication date 22 April 2024

Published in Matemática Contemporânea (Search for Journal in Brave)

zbMATH Keywords

cubic graphNP-completeplanar graphoriented coloring

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs
• SOFSEM 2006: Theory and Practice of Computer Science
• Colourings of oriented connected cubic graphs
• Coloring graphs in oriented coloring of cubic graphs

This page was built for publication: Complexity of the oriented coloring in planar, cubic oriented graphs

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