On low bound of degree sequences of spanning trees inK-edge-connected graphs

DOI10.1002/(SICI)1097-0118(199806)28:2%3C87::AID-JGT2%3E3.0.CO;2-AMaRDI QIDQ4242971zbMATH OpenOpenAlexFDO

Authors Zhenhong Liu, Bao-guang Xu

Publication date 23 August 1999

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199806)28:2%3C87::aid-jgt2%3E3.0.co;2-a

zbMATH Keywords

spanning treeedge connectivitydegree sequences

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Connectivity (05C40)

Recommendations

• Spanning trees and spanning Eulerian subgraphs with small degrees
• Spanning \(k\)-trees of \(n\)-connected graphs
• Connectivity preserving trees in k‐connected or k‐edge‐connected graphs
• scientific article; zbMATH DE number 434863

Cited in

(7)

• Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree
• Spanning \(k\)-trees of \(n\)-connected graphs
• Spanning trees and spanning Eulerian subgraphs with small degrees
• Spanning trees and spanning closed walks with small degrees
• \(k\)-connectivity and decomposition of graphs into forests
• Local spanning trees in graphs and hypergraphs decomposition with respect to edge connectivity
• Spanning trees: A survey

This page was built for publication: On low bound of degree sequences of spanning trees inK-edge-connected graphs

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