Cycles within specified distance from each vertex.

DOI10.1016/J.DISC.2003.05.004zbMATH Open1037.05028OpenAlexW2016731369MaRDI QIDQ1427481FDOQ1427481

Authors: 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

Recommendations

• scientific article; zbMATH DE number 57430
• A note on distance-dominating cycles
• A sufficient condition for dominating cycles
• The \(k\)-dominating cycles in graphs
• scientific article; zbMATH DE number 2197874

zbMATH Keywords

Hamiltonian cyclestable setdominating cycle

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Some Theorems on Abstract Graphs
• A note on Hamiltonian circuits
• Existence of Δλ-cycles and Δλ-paths
• A sufficient condition for dominating cycles

Cited In (4)

• Cycles through given vertices and closures
• Chvátal–Erdős Theorem: Old Theorem with New Aspects
• Title not available (Why is that?)
• A sufficient condition for dominating cycles

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

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