Removable Edges of a Spanning Tree in 3-Connected 3-Regular Graphs

DOI10.1007/978-3-540-73814-5_33MaRDI QIDQ3612600zbMATH OpenOpenAlexFDO

Authors Haiyan Kang, Jichang Wu, Guojun Li

Publication date 10 March 2009

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73814-5_33

zbMATH Keywords

3-connected 3-regular graphedge-vertex-cut fragmentremovable edge

Mathematics Subject Classification ID

Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• scientific article; zbMATH DE number 2075822
• Contractible edges and removable edges in 3-connected graphs
• scientific article; zbMATH DE number 1918634
• On removable edges in 3-connected cubic graphs
• Removable edges in 3-connected graphs

Cited in

(7)

• Contractible edges and removable edges in 3-connected graphs
• Removable edges in a spanning tree of a k-connected graph
• scientific article; zbMATH DE number 4181380 (Why is no real title available?)
• On removable edges in 3-connected cubic graphs
• scientific article; zbMATH DE number 2075822 (Why is no real title available?)
• scientific article; zbMATH DE number 1918634 (Why is no real title available?)
• Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge

This page was built for publication: Removable Edges of a Spanning Tree in 3-Connected 3-Regular Graphs

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