Proves a transversal version of Ghouila-Houri's theorem on directed Hamilton cycles in digraph collections, solving an open problem of Chakraborti et al.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Survey compiling sufficient conditions for transversal m-edge structures in graph systems that extend classical extremal graph theory results, plus conjectures.
citing papers explorer
-
Transversal Hamilton cycles in digraph collections
Proves a transversal version of Ghouila-Houri's theorem on directed Hamilton cycles in digraph collections, solving an open problem of Chakraborti et al.
-
Transversal Structures in Graph Systems: A Survey
Survey compiling sufficient conditions for transversal m-edge structures in graph systems that extend classical extremal graph theory results, plus conjectures.