Acyclic coloring of products of digraphs

DOI10.1016/j.dam.2024.01.020MaRDI QIDQ6130210

Isnard Lopes Costa, Unnamed Author

Publication date: 2 April 2024

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

zbMATH Keywords

products of graphsdichromatic numberproducts of dicycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• The chromatic number of the product of two 4-chromatic graphs is 4
• n-tuple colorings and associated graphs
• Strong products of Kneser graphs
• Strong products of \(\chi\)-critical graphs
• The dichromatic number of a digraph
• The chromatic number and other functions of the lexicographic product
• Tournaments and colouring
• Counterexamples to Hedetniemi's conjecture
• Subdivisions in digraphs of large out-degree or large dichromatic number
• Bounds for the dichromatic number of a generalized lexicographic product of digraphs
• Graphs with Given Group and Given Graph-Theoretical Properties
• The NP-Completeness of Edge-Coloring
• Analogues of the Shannon Capacity of a Graph
• Acyclic Homomorphisms and Circular Colorings of Digraphs
• The circular chromatic number of a digraph
• Spectral Theory and Analysis

This page was built for publication: Acyclic coloring of products of digraphs