SOFSEM 2006: Theory and Practice of Computer Science

DOI10.1007/11611257zbMath1175.05054OpenAlexW2756057450MaRDI QIDQ5897986

Jean-François Culus, Marc Demange

Publication date: 14 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11611257

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Directed graphs (digraphs), tournaments (05C20)

Related Items (11)

Homomorphisms and colourings of oriented graphs: an updated survey ⋮ Equitable oriented coloring ⋮ Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs ⋮ Digraph width measures in parameterized algorithmics ⋮ On the oriented chromatic index of oriented graphs ⋮ Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs ⋮ Efficient computation of the oriented chromatic number of recursively defined digraphs ⋮ Oriented coloring on recursively defined digraphs ⋮ On Digraph Width Measures in Parameterized Algorithmics ⋮ On the oriented coloring of the disjoint union of graphs ⋮ Complexity dichotomy for oriented homomorphism of planar graphs with large girth

This page was built for publication: SOFSEM 2006: Theory and Practice of Computer Science