On the oriented achromatic number of graphs

DOI10.1016/J.DAM.2023.12.021OpenAlexW4391002227MaRDI QIDQ6202937FDOQ6202937

Authors: Éric Sopena 

Publication date: 27 February 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.12.021

zbMATH Keywords

graph homomorphismoriented graphoriented cliquelower oriented achromatic numberoriented achromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Graph theory
• Minimal oriented graphs of diameter 2
• Good and semi-strong colorings of oriented planar graphs
• Title not available (Why is that?)
• The chromatic number of oriented graphs
• Analogues of cliques for oriented coloring
• On the oriented chromatic index of oriented graphs
• On the oriented game chromatic number
• Title not available (Why is that?)
• The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
• Complete oriented colourings and the oriented achromatic number
• Achromatic numbers and graph operations
• Title not available (Why is that?)
• Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs
• On fractional version of oriented coloring
• Chromatic polynomials of oriented graphs
• Title not available (Why is that?)

This page was built for publication: On the oriented achromatic number of graphs

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