Probing equivalent definitions of 2-connected graphs

DOI10.16163/J.CNKI.22-1123/N.2017.01.007MaRDI QIDQ3131815zbMATH OpenFDO

Authors Jing Su, Fei Ma, Bing Yao

Publication date 29 January 2018

zbMATH Keywords

cyclefanpath2-connected graphear decomposition

Mathematics Subject Classification ID

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

Recommendations

• Probing equivalent definitions of 2-edge connected graphs
• Exploring equivalent definitions of Eulerian graphs
• On equivalent definitions about trees and unicyclic graphs
• On equivalent definitions of trees
• scientific article; zbMATH DE number 3916310

Cited in

(5)

• Exploring equivalent definitions of Eulerian graphs
• Equivalence of strongly connected graphs and black-and-white 2-SAT problems
• On equivalent definitions about trees and unicyclic graphs
• On equivalent definitions of trees
• Probing equivalent definitions of 2-edge connected graphs

This page was built for publication: Probing equivalent definitions of 2-connected graphs

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