Oriented colorings of partial 2-trees
DOI10.1016/J.IPL.2008.04.007zbMATH Open1189.05063OpenAlexW2046662685MaRDI QIDQ975406FDOQ975406
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
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
girthcombinatorial problemsoriented chromatic numberseries-parallel graphpartial 2-tree\(K_{4}\) minor-free graph
Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- On the maximum average degree and the oriented chromatic number of a graph
- An oriented coloring of planar graphs with girth at least five
- Good and semi-strong colorings of oriented planar graphs
- Colorings and girth of oriented planar graphs
- An oriented 7-colouring of planar graphs with girth at least 7
- An oriented colouring of planar graphs with girth at least 4
- The chromatic number of oriented graphs
- Homomorphism bounds for oriented planar graphs
- Oriented colorings of triangle-free planar graphs
- Oriented vertex and arc colorings of outerplanar graphs
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
- Coloring the square of a \(K_{4}\)-minor free graph
Cited In (19)
- Homomorphisms of 2-edge-colored graphs
- On the oriented coloring of the disjoint union of graphs
- Homomorphisms and colourings of oriented graphs: an updated survey
- Homomorphism bounds for oriented planar graphs
- Homomorphism bounds for oriented planar graphs of given minimum girth
- A note on integral generalized flows in directed partial 2-trees
- ℱ-WORM colorings of some 2-trees: partition vectors
- Colored homomorphisms of colored mixed graphs
- Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
- An oriented 6-coloring of planar graphs with girth at least 9
- Oriented vertex and arc colorings of outerplanar graphs
- Oriented colorings of 2-outerplanar graphs
- An oriented coloring of planar graphs with girth at least five
- Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
- Homomorphisms and oriented colorings of equivalence classes of oriented graphs
- On arc-coloring of subcubic graphs
- On nice and injective-nice tournaments
- Oriented cliques and colorings of graphs with low maximum degree
- Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms
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)
