Probing equivalent definitions of 2-edge connected graphs

DOI10.3969/J.ISSN.1000-5641.2017.01.003MaRDI QIDQ5368115zbMATH OpenOpenAlexFDO

Authors Jing Su, Fei Ma, Bing Yao

Publication date 20 October 2017

Full work available at URL https://xblk.ecnu.edu.cn/CN/abstract/abstract25370.shtml

zbMATH Keywords

2-edge connected graphblockcycleedge decompositiontrail

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• Probing equivalent definitions of 2-connected graphs
• scientific article; zbMATH DE number 3916310
• Minimally (k, k)‐edge‐connected graphs
• Two paths joining given vertices in \(2k\)-edge-connected graphs
• Exploring equivalent definitions of Eulerian graphs

Cited in

(3)

• On equivalent definitions of trees
• Probing equivalent definitions of 2-connected graphs
• Exploring equivalent definitions of Eulerian graphs

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

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