Distributing vertices along a Hamiltonian cycle in Dirac graphs
From MaRDI portal
Publication:998458
DOI10.1016/j.disc.2007.10.042zbMath1181.05029OpenAlexW2086330117MaRDI QIDQ998458
Gábor N. Sárközy, Stanley M. Selkow
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.10.042
Related Items (10)
Locating sets of vertices on Hamiltonian cycles ⋮ Distributing pairs of vertices on Hamiltonian cycles ⋮ Precise location of vertices on Hamiltonian cycles ⋮ Locating pairs of vertices on Hamiltonian cycles ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Degree sum and graph linkage with prescribed path lengths ⋮ Robust Hamiltonicity of Dirac graphs ⋮ Placing specified vertices at precise locations on a Hamiltonian cycle ⋮ Note on locating pairs of vertices on Hamiltonian cycles ⋮ Locating any two vertices on Hamiltonian cycles in large graphs
Cites Work
- On circuits in graphs
- Proof of the Seymour conjecture for large graphs
- Blow-up lemma
- Advances on the Hamiltonian problem -- a survey
- On a Hamiltonian cycle in which specified vertices are uniformly distributed
- On the number of Hamiltonian cycles in Dirac graphs
- Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
- Graph decomposition: A new key to coding theorems
- An algorithmic version of the blow-up lemma
- Graph decompositions without isolated vertices III
- Hypergraph Packing and Graph Embedding
- Proof of a Packing Conjecture of Bollobás
- On the square of a Hamiltonian cycle in dense graphs
- Subgraphs with prescribed valencies
- Some Theorems on Abstract Graphs
- Proof of the Alon-Yuster conjecture
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Distributing vertices along a Hamiltonian cycle in Dirac graphs
