Implicit-degrees and circumferences
From MaRDI portal
Publication:913815
DOI10.1007/BF01788680zbMath0701.05030MaRDI QIDQ913815
Xiaotie Deng, Hao Li, Yung-ching Chu
Publication date: 1989
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Related Items (19)
An implicit degree condition for relative length of long paths and cycles in graphs ⋮ 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 pancyclicity of graphs ⋮ An implicit degree sum condition for cycles through specified vertices ⋮ An implicit degree Ore-condition for pancyclicity of graphs ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Hamilton cycles in implicit claw-heavy graphs ⋮ An implicit degree condition for Hamiltonian graphs ⋮ An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian ⋮ On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs ⋮ An implicit weighted degree condition for heavy cycles ⋮ A sufficient condition involving implicit degree and neighborhood intersection for long cycles ⋮ An Implicit Degree Condition for Cyclability in Graphs ⋮ Implicit degree condition for Hamiltonicity of 2-heavy graphs ⋮ A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs ⋮ Conditions on subgraphs, degrees, and domination for Hamiltonian properties of graphs ⋮ An implicit degree condition for long cycles in 2-connected graphs
Cites Work
This page was built for publication: Implicit-degrees and circumferences
