Probing equivalent definitions of 2-connected graphs

DOI10.16163/J.CNKI.22-1123/N.2017.01.007zbMATH Open1389.05089MaRDI QIDQ3131815FDOQ3131815

Fei Ma, Jing Su, Bing Yao

Publication date: 29 January 2018

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

zbMATH Keywords

cyclefanpath2-connected graphear decomposition

Mathematics Subject Classification ID

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

Cited In (1)

• Equivalence of strongly connected graphs and black-and-white 2-SAT problems

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)