On the oriented chromatic number of dense graphs

MaRDI QIDQ3558604zbMATHFDO

Authors David R. Wood

Publication date 5 May 2010

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

zbMATH Keywords

graphhypercubedegreegraph colouringoriented chromatic numberoriented colouringdiameter problemharmonious colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

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

Cited in

(6)

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

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)