Oriented vertex and arc colorings of outerplanar graphs
From MaRDI portal
Publication:845839
DOI10.1016/j.ipl.2006.06.012zbMath1185.05064MaRDI QIDQ845839
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.06.012
combinatorial problems; outerplanar graph; oriented chromatic number; Girth; oriented chromatic index
05C38: Paths and cycles
05C15: Coloring of graphs and hypergraphs
05C20: Directed graphs (digraphs), tournaments
Related Items
Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs, Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs, Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs, Homomorphisms and colourings of oriented graphs: an updated survey, Homomorphism bounds for oriented planar graphs of given minimum girth, Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms, Oriented colorings of partial 2-trees, An oriented coloring of planar graphs with girth at least five, Oriented colourings of graphs with maximum degree three and four, Oriented chromatic number of Cartesian products \(P_m \square P_n\) and \(C_m \square P_n \), Oriented cliques and colorings of graphs with low maximum degree, On homomorphisms of oriented graphs with respect to the push operation, Miscellaneous Digraph Classes, Oriented vertex and arc colorings of partial 2-trees
Cites Work
- Unnamed Item
- Unnamed Item
- Oriented colorings of triangle-free planar graphs
- On the maximum average degree and the oriented chromatic number of a graph
- Good and semi-strong colorings of oriented planar graphs
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
- Colorings and girth of oriented planar graphs
- An oriented 7-colouring of planar graphs with girth at least 7
- The chromatic number of oriented graphs
- On the oriented chromatic index of oriented graphs
- Oriented graph coloring
