Implicit degree condition for Hamiltonicity of 2-heavy graphs

DOI10.1016/J.DAM.2016.10.031zbMath1354.05031OpenAlexW2565029142MaRDI QIDQ505434

Xing Huang

Publication date: 23 January 2017

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

Full work available at URL: https://doi.org/10.1016/j.dam.2016.10.031

zbMATH Keywords

Hamilton cycleimplicit degree2-heavy graph\(f\)-implicit-heavy graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (2)

An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian ⋮ On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An implicit degree condition for Hamiltonian graphs
• New sufficient conditions for cycles in graphs
• Implicit-degrees and circumferences
• Dirac's minimum degree condition restricted to claws
• Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity
• Large cycles in graphs
• Note on Hamilton Circuits
• Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs

This page was built for publication: Implicit degree condition for Hamiltonicity of 2-heavy graphs