Oriented colorings of partial 2-trees

DOI10.1016/J.IPL.2008.04.007MaRDI QIDQ975406zbMATHOpenAlexFDO

Authors Pascal Ochem, Alexandre Pinlou

Publication date 9 June 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2008.04.007

zbMATH Keywords

girthcombinatorial problemsoriented chromatic numberseries-parallel graphpartial 2-tree\(K_{4}\) minor-free graph

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Oriented vertex and arc colorings of partial 2-trees
• Oriented colorings of 2-outerplanar graphs
• Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
• Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
• Oriented coloring on recursively defined digraphs
• Colorings and orientations of graphs
• SOFSEM 2006: Theory and Practice of Computer Science
• Oriented colouring of some graph products
• Edge-Coloring Partialk-Trees
• Reconfiguring vertex colourings of 2-trees

Cites work

• scientific article; zbMATH DE number 2117181 (Why is no real title available?)
• An oriented 7-colouring of planar graphs with girth at least 7
• An oriented coloring of planar graphs with girth at least five
• An oriented colouring of planar graphs with girth at least 4
• Coloring the square of a \(K_{4}\)-minor free graph
• Colorings and girth of oriented planar graphs
• Good and semi-strong colorings of oriented planar graphs
• Homomorphism bounds for oriented planar graphs
• On the maximum average degree and the oriented chromatic number of a graph
• Oriented colorings of triangle-free planar 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

(21)

• On the existence and non-existence of improper homomorphisms of oriented and \(2\)-edge-coloured graphs to reflexive targets
• ℱ-WORM colorings of some 2-trees: partition vectors
• A note on integral generalized flows in directed partial 2-trees
• On arc-coloring of subcubic graphs
• Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
• Homomorphisms of partial \(t\)-trees and edge-colorings of partial 3-trees
• On the oriented coloring of the disjoint union of graphs
• Homomorphisms and colourings of oriented graphs: an updated survey
• An oriented coloring of planar graphs with girth at least five
• Homomorphisms of 2-edge-colored graphs
• Oriented vertex and arc colorings of outerplanar graphs
• Oriented colorings of 2-outerplanar graphs
• Colored homomorphisms of colored mixed graphs
• Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
• Oriented cliques and colorings of graphs with low maximum degree
• Homomorphism bounds for oriented planar graphs
• Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms
• An oriented 6-coloring of planar graphs with girth at least 9
• Homomorphism bounds for oriented planar graphs of given minimum girth
• On nice and injective-nice tournaments
• Homomorphisms and oriented colorings of equivalence classes of oriented graphs

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

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