Multiplicativity of acyclic digraphs
From MaRDI portal
Publication:1377696
DOI10.1016/S0012-365X(96)00301-9zbMath0888.05031OpenAlexW2063649596MaRDI QIDQ1377696
Publication date: 1 June 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00301-9
Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Infinite automorphism groups (20B27)
Related Items (1)
Cites Work
- Unnamed Item
- Symmetric graphs and interpretations
- The chromatic number of the product of two 4-chromatic graphs is 4
- The chromatic number of the product of two \(\aleph _ 1\)-chromatic graphs can be countable
- On the complexity of H-coloring
- On multiplicative graphs and the product conjecture
- On the arc-chromatic number of a digraph
- A simple proof of the multiplicativity of directed cycles of prime power length
- On classes of relations and graphs determined by subobjects and factorobjects
- Multiplicativity of acyclic local tournaments
- Homomorphisms to oriented cycles
- Mutiplicativity of oriented cycles
- Parallel concepts in graph theory
- On the chromatic number of the product of graphs
- Multiplicativity. Part I. Variations, multiplicative graphs, and digraphs
- Multiplicativity. Part II. Nonmultiplicative digraphs and characterization of oriented paths
- On the Nonmultiplicativity of Oriented Cycles
- An approach to hedetniemi's conjecture
- The Categorical Product of Graphs
This page was built for publication: Multiplicativity of acyclic digraphs
