An implicit degree condition for cyclability of 2-heavy graphs.

MaRDI QIDQ3297138zbMATH OpenFDO

Authors Xing Huang

Publication date 2 July 2020

zbMATH Keywords

2-heavy graphcyclabilityHamilton cycleimplicit degree

Mathematics Subject Classification ID

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

Recommendations

• Hamilton cycles in implicit 2-heavy graphs
• Implicit degree condition for Hamiltonicity of 2-heavy graphs
• An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian
• An implicit degree condition for cyclability in graphs
• On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs

Cited in

(3)

• An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian
• An implicit degree condition for cyclability in graphs
• scientific article; zbMATH DE number 7397946 (Why is no real title available?)

This page was built for publication: An implicit degree condition for cyclability of 2-heavy graphs.

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