Notes on Hamiltonian graphs and Hamiltonian-connected graphs

zbMATH Open1289.05241MaRDI QIDQ5397288FDOQ5397288

Authors: Guojun Li, Jin Yan, Yunshu Gao 

Publication date: 19 February 2014

Recommendations

• scientific article; zbMATH DE number 1246415
• New sufficient condition for Hamiltonian graphs
• scientific article; zbMATH DE number 540116
• New sufficient conditions for \(s\)-Hamiltonian graphs and \(s\)-Hamiltonian connected graphs
• scientific article; zbMATH DE number 1322572

zbMATH Keywords

Hamiltonian graphdegree conditionHamiltonian-connected graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Connectivity (05C40)

Cited In (11)

• A note on Frucht diagrams, Boolean graphs and Hamilton cycles
• Title not available (Why is that?)
• Title not available (Why is that?)
• A study on degree characterization for Hamiltonian-connected graphs.
• Bounds for the independence number in \(k\)-step Hamiltonian graphs
• Chromatic number and Hamiltonicity of graphs
• Independence number, neighborhood intersection and Hamiltonian properties
• New sufficient conditions for \(s\)-Hamiltonian graphs and \(s\)-Hamiltonian connected graphs
• Title not available (Why is that?)
• Extremal graphs with given stability number and connectivity. I
• Remarks on Hamiltonian digraphs

This page was built for publication: Notes on Hamiltonian graphs and Hamiltonian-connected graphs

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