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

MaRDI QIDQ5453045zbMATH OpenFDO

Authors Jianglu Wang, Guo Cheng Gao, Xiaoyan Liu

Publication date 4 April 2008

zbMATH Keywords

\([s,t\)-graph]\(k\)-connectedcycle

Mathematics Subject Classification ID

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

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

Cited in

(8)

• Cycle-connected graphs
• Hamilton cycles in 2-connected \([5,3]\)-graphs
• scientific article; zbMATH DE number 140120 (Why is no real title available?)
• 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
• Graphs with cyclomatic number two having panconnected square
• A generalization of the Chvátal-Erdős theorem
• A sufficient condition for pancyclic 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)