Oriented vertex and arc colorings of partial 2-trees

DOI10.1016/J.ENDM.2007.07.034MaRDI QIDQ3503473zbMATH OpenOpenAlexFDO

Authors 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.2007.07.034

zbMATH Keywords

oriented \(k\)-vertex-coloringoriented graph

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Cites work

• Coloring the square of a \(K_{4}\)-minor free graph
• Colorings and girth of oriented planar graphs
• scientific article; zbMATH DE number 2117181 (Why is no real title available?)
• On arc-coloring of subcubic graphs
• On the maximum average degree and the oriented chromatic number of a graph
• On the oriented chromatic index of oriented graphs
• Oriented vertex and arc colorings of outerplanar graphs
• The chromatic number of oriented graphs
• The monadic second order logic of graphs. VI: On several representations of graphs by relational structures

Cited in

(5)

• A homomorphic polynomial for oriented graphs
• Homomorphisms and colourings of oriented graphs: an updated survey
• Miscellaneous digraph classes
• ℱ-WORM colorings of some 2-trees: partition vectors
• Oriented colorings of partial 2-trees

This page was built for publication: Oriented vertex and arc colorings of partial 2-trees

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