Cycles within specified distance from each vertex.

DOI10.1016/J.DISC.2003.05.004zbMath1037.05028OpenAlexW2016731369MaRDI QIDQ1427481

Akira Saito, Tomoki Yamashita

Publication date: 14 March 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.05.004

zbMATH Keywords

stable setHamiltonian cycledominating cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Chvátal–Erdős Theorem: Old Theorem with New Aspects

Cites Work

• Unnamed Item
• A sufficient condition for dominating cycles
• A note on Hamiltonian circuits
• Existence of Δλ-cycles and Δλ-paths
• Some Theorems on Abstract Graphs

This page was built for publication: Cycles within specified distance from each vertex.