Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs

DOI10.1007/978-3-030-68211-8_15OpenAlexW3132311874MaRDI QIDQ2232245

Frank Gurski, Dominique Komander, Marvin Lindemann

Publication date: 4 October 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-68211-8_15

zbMATH Keywords

graph homomorphismslinear time algorithmsoriented coloringminimal series-parallel digraphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (2)

The knapsack problem with special neighbor constraints ⋮ Efficient computation of the oriented chromatic number of recursively defined digraphs

Cites Work

• Unnamed Item
• Homomorphisms and colourings of oriented graphs: an updated survey
• Homomorphism bounds for oriented planar graphs of given minimum girth
• Parameterized algorithms for directed modular width
• Directed NLC-width
• The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
• Homomorphisms and oriented colorings of equivalence classes of oriented graphs
• Upper bounds to the clique width of graphs
• Oriented coloring on recursively defined digraphs
• The oriented chromatic number of Halin graphs
• Digraph width measures in parameterized algorithmics
• Oriented coloring of msp-digraphs and oriented co-graphs (extended abstract)
• The Parameterized Complexity of Oriented Colouring
• The Recognition of Series Parallel Digraphs
• Graph Classes: A Survey
• The chromatic number of oriented graphs
• Classes of Directed Graphs
• Digraphs
• Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
• SOFSEM 2006: Theory and Practice of Computer Science

This page was built for publication: Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs