An Implicit Degree Condition for Cyclability in Graphs

DOI10.1007/978-3-642-21204-8_12zbMath1329.05164OpenAlexW54346197MaRDI QIDQ3004658

Wantao Ning, Jun-qing Cai, Hao Li

Publication date: 3 June 2011

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21204-8_12

zbMATH Keywords

graphcyclescyclabilityimplicit degree

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (9)

Fan-type implicit-heavy subgraphs for Hamiltonicity of implicit claw-heavy graphs ⋮ Hamilton cycles in implicit 2-heavy graphs ⋮ Minimum implicit degree condition restricted to claws for Hamiltonian cycles ⋮ An implicit degree sum condition for cycles through specified vertices ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Hamilton cycles in implicit claw-heavy graphs ⋮ On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs ⋮ A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs ⋮ Conditions on subgraphs, degrees, and domination for Hamiltonian properties of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Implicit-degrees and circumferences
• Cycles through subsets with large degree sums
• Cycles through prescribed vertices with large degree sum
• A note on a generalisation of Ore's condition
• Note on Hamilton Circuits
• 2‐neighborhoods and hamiltonian conditions
• Some Theorems on Abstract Graphs

This page was built for publication: An Implicit Degree Condition for Cyclability in Graphs