Cyclability, connectivity and circumference

DOI10.1007/978-3-031-25211-2_20arXiv2211.03095OpenAlexW4318022999MaRDI QIDQ6132541

Niranjan Balachandran, Anish Hebbar

Publication date: 17 August 2023

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.03095

zbMATH Keywords

connectivitycircumferenceHamiltonicitycyclability

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• Longest cycles in \(k\)-connected graphs with given independence number
• Cyclability in graph classes
• Edge bounds in nonhamiltonian \(k\)-connected graphs
• A look at cycles containing specified elements of a graph
• New families of hypohamiltonian graphs
• A method in graph theory
• Long cycles in 3-cyclable graphs
• A note on Hamiltonian circuits
• Note on Hamilton Circuits
• On maximal paths and circuits of graphs
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• An Improved Algorithm for Finding Cycles Through Elements
• k-ordered Hamiltonian graphs
• Some Theorems on Abstract Graphs
• Survey of results on \(k\)-ordered graphs

This page was built for publication: Cyclability, connectivity and circumference