On the oriented chromatic number of dense graphs

zbMATH Open1203.05061arXivmath/0611865MaRDI QIDQ3558604FDOQ3558604

Authors: David R. Wood 

Publication date: 5 May 2010

Full work available at URL: https://arxiv.org/abs/math/0611865

Recommendations

• On the maximum average degree and the oriented chromatic number of a graph
• Acyclic and oriented chromatic numbers of graphs
• The chromatic number of oriented graphs
• scientific article; zbMATH DE number 1341913
• Oriented graph coloring

zbMATH Keywords

graphhypercubedegreegraph colouringoriented chromatic numberoriented colouringdiameter problemharmonious colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (6)

• The oriented chromatic number of the hexagonal grid is 6
• Homomorphisms and colourings of oriented graphs: an updated survey
• On the oriented chromatic number of grids
• On the oriented chromatic number of graphs with given excess
• The oriented chromatic number of Halin graphs
• Oriented colourings of graphs with maximum degree three and four

This page was built for publication: On the oriented chromatic number of dense graphs

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