Packing spanning trees in highly essentially connected graphs
Packing spanning trees in highly essentially connected graphs is a scholarly work, published in 2019 in ''Discrete Mathematics''. The main subjects of the publication include graph, graph theory, graph connectivity measure, spanning tree, discrete mathematics, planar graph, interacting particle system, combinatorics, and mathematics. The authors prove that every g-edge-connected, essentially h-edge-connected graph G with g≥k+1 and h≥g2g−k−2 satisfies τ(G)≥k.