Multiplicativity of acyclic local tournaments

DOI10.1007/BF01196137zbMath0907.05023OpenAlexW2016482820MaRDI QIDQ1276271

Xuding Zhu, Hui Shan Zhou

Publication date: 24 January 1999

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01196137

zbMATH Keywords

digraphsproduct of graphsacyclic Hamiltonian digraphsmultiplicative graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Multiplicativity of acyclic digraphs ⋮ Chromatic Ramsey numbers

Cites Work

• Unnamed Item
• 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
• A simple proof of the multiplicativity of directed cycles of prime power length
• On classes of relations and graphs determined by subobjects and factorobjects
• Homomorphisms to oriented cycles
• Mutiplicativity of oriented cycles
• Multiplicativity of acyclic digraphs
• Locally semicomplete digraphs: A generalization of tournaments
• 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

This page was built for publication: Multiplicativity of acyclic local tournaments