On the oriented coloring of the disjoint union of graphs

DOI10.1007/978-3-030-79987-8_14OpenAlexW3173252628MaRDI QIDQ2115853

Hebert Coelho, Erika M. M. Coelho, Mateus de Paula Ferreira, Sylvain Gravier, Sulamita Klein, Luérbio Faria

Publication date: 22 March 2022

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

zbMATH Keywords

oriented graphgraph classesoriented chromatic numberdisjoint union of graphsdisconnected graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Homomorphisms and colourings of oriented graphs: an updated survey
• Homomorphism bounds for oriented planar graphs of given minimum girth
• Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs
• Oriented colorings of partial 2-trees
• On the oriented chromatic number of grids
• Good and semi-strong colorings of oriented planar graphs
• Homomorphisms and oriented colorings of equivalence classes of oriented graphs
• Oriented chromatic number of Cartesian products and strong products of paths
• Oriented colouring of some graph products
• New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes
• The chromatic number of oriented graphs
• Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs
• SOFSEM 2006: Theory and Practice of Computer Science

This page was built for publication: On the oriented coloring of the disjoint union of graphs