An existence criterion for a cycle such that the vertices not included in it are independent

DOI10.1007/S10958-023-06668-8MaRDI QIDQ6147864

N. A. Karol

Publication date: 1 February 2024

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian cyclelength of a cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• A lower bound for the circumference of a graph
• A theorem on paths in planar graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: An existence criterion for a cycle such that the vertices not included in it are independent