On the oriented coloring of the disjoint union of graphs

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

Authors: Erika M. M. Coelho, Hebert Coelho, Mateus de Paula Ferreira, Sylvain Gravier, Sulamita Klein, Luerbio Faria 

Publication date: 22 March 2022

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

zbMATH Keywords

graph classesoriented graphoriented 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

• 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
• Homomorphisms and colourings of oriented graphs: an updated survey
• Oriented colouring of some graph products
• New results on the complexity of oriented colouring on restricted digraph classes
• Homomorphism bounds for oriented planar graphs of given minimum girth
• The chromatic number of oriented graphs
• SOFSEM 2006: Theory and Practice of Computer Science
• Oriented colorings of partial 2-trees
• Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs
• Oriented chromatic number of Cartesian products and strong products of paths
• Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs

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

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