The cycle in 2-connected [4,2]-graphs

zbMATH Open1156.05320MaRDI QIDQ5453045FDOQ5453045

Authors: Jianglu Wang, Guo Cheng Gao, Xiaoyan Liu 

Publication date: 4 April 2008

Recommendations

• Hamilton cycles in 2-connected \([5,3]\)-graphs
• Cycle-connected graphs
• A sufficient condition of a pancyclicity \([s,t]\)-graph
• Even cycles in graphs
• scientific article; zbMATH DE number 3961655

zbMATH Keywords

cycle\(k\)-connected\([s,t\)-graph]

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Cited In (6)

• Graphs with cyclomatic number two having panconnected square
• Hamilton cycles in 2-connected \([5,3]\)-graphs
• Title not available (Why is that?)
• THE NUMBER OF DISTINCT 4-CYCLES AND 2-MATCHINGS OF SOME ZERO-DIVISOR GRAPHS
• The number of $4$-cycles and the cyclomatic number of a finite simple graph
• Cycle-connected graphs

This page was built for publication: The cycle in 2-connected \([4,2]\)-graphs

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