On the number of alternating paths in bipartite complete graphs
From MaRDI portal
Publication:2014212
DOI10.1007/s00373-017-1771-xzbMath1368.05086arXiv1603.04923OpenAlexW2297478040MaRDI QIDQ2014212
Andrzej Dudek, Patrick Bennett, Elliot Laforge
Publication date: 10 August 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.04923
Integer programming (90C10) Connectivity (05C40) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rainbow Hamilton cycles in uniform hypergraphs
- Counting paths in digraphs
- Alternating Hamiltonian cycles
- A property of the colored complete graph
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- Graphs with Hamiltonian cycles having adjacent lines different colours
- Multicoloured Hamilton cycles
- Extensions of results on rainbow Hamilton cycles in uniform hypergraphs