Two types of path structures of graphs

DOI10.1080/02522667.2011.10700118MaRDI QIDQ2903241zbMATH OpenOpenAlexFDO

Authors Kewen Zhao

Publication date 8 August 2012

Published in Journal of Information \& Optimization Sciences (Search for Journal in Brave)

Full work available at URL http://www.connectjournals.com/file_html_pdf/1268406H_02_JIOS_T122_32-6_pp1259-1268a.pdf

zbMATH Keywords

2-connected graph

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• scientific article; zbMATH DE number 6006
• A note on the smallest connected non-traceable cubic bipartite planar graph
• A sufficient condition for graphs with large neighborhood unions to be traceable
• scientific article; zbMATH DE number 4099351
• scientific article; zbMATH DE number 1151799

Cites work

• A comprehensive analysis of degree based condition for Hamiltonian cycles
• A new sufficient condition for hamiltonicity of graphs
• A sufficient condition for pancyclic graphs
• Hamiltonian-connected graphs
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On Hamiltonian cycles and Hamiltonian paths

Cited in

(1)

• scientific article; zbMATH DE number 6006 (Why is no real title available?)

This page was built for publication: Two types of path structures of graphs

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