On a Hamiltonian cycle in which specified vertices are uniformly distributed
From MaRDI portal
Publication:1850512
DOI10.1006/JCTB.2000.1999zbMATH Open1027.05057OpenAlexW2064737922MaRDI QIDQ1850512FDOQ1850512
Authors: Atsushi Kaneko, Kiyoshi Yoshimoto 
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.2000.1999
Recommendations
Cites Work
Cited In (15)
- Recent advances on the Hamiltonian problem: survey III
- On degree sum conditions for directed path-factors with a specified number of paths
- Placing specified vertices at precise locations on a Hamiltonian cycle
- Note on semi-linkage with almost prescribed lengths in large graphs
- 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
- A look at cycles containing specified elements of a graph
- Distributing vertices along a Hamiltonian cycle in Dirac graphs
- Distributing pairs of vertices on Hamiltonian cycles
- Embedding spanning subgraphs in uniformly dense and inseparable graphs
- A Hamilton cycle in which specified vertices are located in polar opposite
- On a Hamiltonian cycle in which specified vertices are not isolated
- Distributing vertices carefully on a Hamiltonian cycle
- Distributing vertices on Hamiltonian cycles
This page was built for publication: On a Hamiltonian cycle in which specified vertices are uniformly distributed
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850512)
