From one to many rainbow Hamiltonian cycles
From MaRDI portal
Publication:2102759
DOI10.1007/s00373-022-02574-zOpenAlexW3153372228MaRDI QIDQ2102759
Kevin Halasz, Ladislav Stacho, Peter Bradshaw
Publication date: 29 November 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.07020
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Transversal (matching) theory (05D15) Eulerian and Hamiltonian graphs (05C45)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Perfect matchings in 3-partite 3-uniform hypergraphs
- On the numbers of 1-factors and 1-factorizations of hypergraphs
- Hamiltonian cycles in Dirac graphs
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Independent dominating sets and a second hamiltonian cycle in regular graphs
- Chords of longest cycles in cubic graphs
- A lower bound on the number of hamiltonian cycles
- An approximate version of a conjecture of Aharoni and Berger
- Vertex degree sums for perfect matchings in 3-uniform hypergraphs
- Additive triples of bijections, or the toroidal semiqueens problem
- Density of Gallai multigraphs
- On Hamiltonian bipartite graphs
- Transversals and bipancyclicity in bipartite graph families
- An asymptotic for the Hall-Paige conjecture
- On a rainbow version of Dirac's theorem
- Almost all Steiner triple systems have perfect matchings
- Independent dominating sets and hamiltonian cycles
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Hamiltonian Cycles and Uniquely Edge Colourable Graphs
- Some Matching Problems for Bipartite Graphs
- On the Minimum Number of Hamiltonian Cycles in Regular Graphs
- 4-regular 4-connected Hamiltonian graphs with few Hamiltonian cycles
- Regular Graphs with Few Longest Cycles
- A rainbow version of Mantel's Theorem
- Paths, Trees, and Flowers
- Representation of Large Matchings in Bipartite Graphs
- Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting
- Probability and Computing
- Some Theorems on Abstract Graphs
This page was built for publication: From one to many rainbow Hamiltonian cycles
