Removable edges in a spanning tree of a \(k\)-connected graph

DOI10.1007/s10255-013-0258-7zbMath1283.05115OpenAlexW2116774967MaRDI QIDQ2439257

Li Qiong Xu

Publication date: 14 March 2014

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-013-0258-7

zbMATH Keywords

\(k\)-connected graphremovable edgeedge-vertex-cut fragments

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Removable edges in a \(k\)-connected graph and a construction method for \(k\)-connected graphs
• Minimally 3-connected graphs
• Generalizaions of critical connectivity of graphs
• A classification of 4-connected graphs
• The number of removable edges in 3-connected graphs
• The number of removable edges in a 4-connected graph
• Removable edges in a cycle of a 4-connected graph
• Removable edges in a 5-connected graph and a construction method of 5-connected graphs
• Removable edges in 3-connected graphs
• A Construction Method For Minimally K-Edge-Connected Graphs
• Uncontractable 4-connected graphs
• A Reduction Method for Edge-Connectivity in Graphs
• Minimally 2-connected graphs.

This page was built for publication: Removable edges in a spanning tree of a \(k\)-connected graph