Strong oriented chromatic number of planar graphs without cycles of specific lengths

DOI10.1016/J.ENDM.2008.01.006MaRDI QIDQ3503527zbMATH OpenOpenAlexFDO

Authors Mickaël Montassier, Pascal Ochem, Alexandre Pinlou

Publication date 5 June 2008

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2008.01.006

zbMATH Keywords

strong oriented \(k\)-coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Strong oriented chromatic number of planar graphs without short cycles
• Good and semi-strong colorings of oriented planar graphs
• Strong edge-coloring of planar graphs
• An oriented colouring of planar graphs with girth at least 4
• An oriented coloring of planar graphs with girth at least five

Cites work

• Acyclic and oriented chromatic numbers of graphs
• Antisymmetric flows and strong colourings of oriented graphs
• Antisymmetric flows and strong oriented coloring of planar graphs
• Antisymmetric flows on planar graphs
• scientific article; zbMATH DE number 2159660 (Why is no real title available?)
• On the maximum average degree and the oriented chromatic number of a graph
• Oriented graph coloring
• Strong oriented chromatic number of planar graphs without short cycles
• The chromatic number of oriented graphs

Cited in

(2)

• Good and semi-strong colorings of oriented planar graphs
• Strong oriented chromatic number of planar graphs without short cycles

This page was built for publication: Strong oriented chromatic number of planar graphs without cycles of specific lengths

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