An implicit degree condition for cyclability in graphs

DOI10.1007/978-3-642-21204-8_12MaRDI QIDQ3004658zbMATH OpenOpenAlexFDO

Authors Hao Li, Wantao Ning, Junqing Cai

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

cyclabilitycyclesgraphimplicit degree

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• An implicit degree sum condition for cycles through specified vertices
• An implicit degree condition for cyclability of 2-heavy graphs.
• scientific article; zbMATH DE number 6770098
• An implicit degree Dirac condition for Hamiltonian cycles.
• An implicit degree condition for Hamiltonian cycles

Cites work

• 2‐neighborhoods and hamiltonian conditions
• A note on a generalisation of Ore's condition
• Cycles through prescribed vertices with large degree sum
• Cycles through subsets with large degree sums
• Graph theory with applications
• scientific article; zbMATH DE number 4185649 (Why is no real title available?)
• Implicit-degrees and circumferences
• Note on Hamilton Circuits
• Some Theorems on Abstract Graphs

Cited in

(19)

• Structural conditions for cycle completable graphs
• A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs
• On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs
• Conditions on subgraphs, degrees, and domination for Hamiltonian properties of graphs
• An implicit degree sum condition for cycles through specified vertices
• A note on a generalisation of Ore's condition
• 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 condition for cyclability of 2-heavy graphs.
• On the existence of a specified cycle in digraphs with constraints on degrees
• scientific article; zbMATH DE number 7397946 (Why is no real title available?)
• An implicit degree Ore-condition for pancyclicity of graphs
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• A minimum degree condition forcing complete graph immersion
• Hamilton cycles in implicit claw-heavy graphs
• A sufficient condition involving implicit degree and neighborhood intersection for long cycles
• A degree condition for cycles passing through specified vertices and edges
• Implicit degree condition restricted to essential independent sets for Hamiltonian cycles

This page was built for publication: An implicit degree condition for cyclability in graphs

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