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

DOI10.1007/978-3-540-73814-5_33zbMath1214.05063OpenAlexW1575613089MaRDI QIDQ3612600

Jichang Wu, Haiyan Kang, Guo Jun 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

removable edgeedge-vertex-cut fragment3-connected 3-regular graph

Mathematics Subject Classification ID

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

Related Items

On removable edges in 3-connected cubic graphs ⋮ Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge ⋮ Contractible edges and removable edges in 3-connected graphs