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

DOI<87::AID-JGT2>3.0.CO;2-A 10.1002/(SICI)1097-0118(199806)28:2<87::AID-JGT2>3.0.CO;2-AzbMath0923.05015OpenAlexW4248133765MaRDI QIDQ4242971

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<87::aid-jgt2>3.0.co;2-a

zbMATH Keywords

spanning treeedge connectivitydegree sequences

Mathematics Subject Classification ID

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

Related Items (4)

Spanning trees and spanning closed walks with small degrees ⋮ Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree ⋮ Spanning trees: A survey ⋮ Spanning trees and spanning Eulerian subgraphs with small degrees

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