Distributing vertices along a Hamiltonian cycle in Dirac graphs

DOI10.1016/J.DISC.2007.10.042MaRDI QIDQ998458zbMATH OpenOpenAlexFDO

Authors Gábor N. Sárközy, Stanley 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

zbMATH Keywords

distancegraph theoryHamiltonian cycleDirac graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Distance in graphs (05C12)

Recommendations

• Hamiltonian cycles of certain kinds of graphs satisfying Dirac condition
• On a Hamiltonian cycle in which specified vertices are uniformly distributed
• Distributing vertices on Hamiltonian cycles
• Distributing pairs of vertices on Hamiltonian cycles
• Distributing vertices carefully on a Hamiltonian cycle

Cites work

• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3603293 (Why is no real title available?)
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 1286511 (Why is no real title available?)
• scientific article; zbMATH DE number 878896 (Why is no real title available?)
• scientific article; zbMATH DE number 3215864 (Why is no real title available?)
• Advances on the Hamiltonian problem -- a survey
• An algorithmic version of the blow-up lemma
• Blow-up lemma
• Graph decomposition: A new key to coding theorems
• Graph decompositions without isolated vertices III
• Hypergraph Packing and Graph Embedding
• On a Hamiltonian cycle in which specified vertices are uniformly distributed
• On circuits in graphs
• On the number of Hamiltonian cycles in Dirac graphs
• On the square of a Hamiltonian cycle in dense graphs
• Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
• Proof of a Packing Conjecture of Bollobás
• Proof of the Alon-Yuster conjecture
• Proof of the Seymour conjecture for large graphs
• Some Theorems on Abstract Graphs
• Subgraphs with prescribed valencies

Cited in

(14)

• Degree sum and graph linkage with prescribed path lengths
• Recent advances on the Hamiltonian problem: survey III
• Placing specified vertices at precise locations on a Hamiltonian cycle
• Locating sets of vertices on Hamiltonian cycles
• Precise location of vertices on Hamiltonian cycles
• Locating pairs of vertices on Hamiltonian cycles
• Note on locating pairs of vertices on Hamiltonian cycles
• Locating any two vertices on Hamiltonian cycles in large graphs
• Hamiltonian cycles of certain kinds of graphs satisfying Dirac condition
• Distributing pairs of vertices on Hamiltonian cycles
• On a Hamiltonian cycle in which specified vertices are uniformly distributed
• Distributing vertices carefully on a Hamiltonian cycle
• Robust Hamiltonicity of Dirac graphs
• Distributing vertices on Hamiltonian cycles

This page was built for publication: Distributing vertices along a Hamiltonian cycle in Dirac graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998458)