Removable edges in a spanning tree of a 4-connected graph

MaRDI QIDQ3538101zbMATH OpenFDO

Authors Liqiong Xu, Xiaofeng Guo

Publication date 24 November 2008

zbMATH Keywords

4-connected graphremovable edgespanning tree

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• Removable edges in a spanning tree of a k-connected graph
• The number of removable edges in a 4-connected graph
• scientific article; zbMATH DE number 1500199
• Contractible edges and removable edges in 3-connected graphs
• Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph

Cited in

(4)

• The number of removable edges in a 4-connected graph
• Contractible edges and removable edges in 3-connected graphs
• Removable edges in a spanning tree of a k-connected graph
• Removable edges in the longest cycles of a 4-connected graph

This page was built for publication: Removable edges in a spanning tree of a 4-connected graph

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