Bounds of the number of disjoint spanning trees

DOI10.1016/0095-8956(74)90087-2zbMath0285.05113OpenAlexW1963619425MaRDI QIDQ1844855

Sukhamay Kundu

Publication date: 1974

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(74)90087-2

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (51)

Packing spanning trees in highly essentially connected graphs ⋮ Methods and problems of communication in usual networks ⋮ A note on edge-disjoint Hamilton cycles in line graphs ⋮ Packing plane spanning trees and paths in complete geometric graphs ⋮ \(k\)-connectivity and decomposition of graphs into forests ⋮ The maximum genus of graph bundles ⋮ Maximum genus and connectivity ⋮ An Eulerian exposition ⋮ The total interval number of a graph ⋮ A flow theory for the dichromatic number ⋮ A tight lower bound on the maximum genus of a simplicial graph ⋮ Flows and generalized coloring theorems in graphs ⋮ Edge-disjoint spanning trees and eigenvalues of regular graphs ⋮ Packing plane spanning trees into a point set ⋮ Edge-disjoint Steiner trees and connectors in graphs ⋮ Antisymmetric flows and edge-connectivity ⋮ Circular flow on signed graphs ⋮ Colouring edges with many colours in cycles ⋮ How many conjectures can you stand? A survey ⋮ Up-embeddability of a graph by order and girth ⋮ On factors of 4-connected claw-free graphs ⋮ Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem ⋮ Edge-disjoint spanning trees and the number of maximum state circles of a graph ⋮ Results of the maximum genus of graphs ⋮ Nowhere-zero 3-flows of highly connected graphs ⋮ On the lower bounds for the maximum genus for simple graphs ⋮ Antiparallel \(d\)-stable traces and a stronger version of ore problem ⋮ The maximum genus of graphs of diameter two ⋮ A sufficient condition on upper embeddability of graphs ⋮ Edge-disjoint spanning trees and forests of graphs ⋮ Upper-embeddable graphs and related topics ⋮ Upper embeddability and connectivity of graphs ⋮ The maximum genus of a 3-regular simplicial graph ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the edge connectivity, Hamiltonicity, and toughness of vertex-transitive graphs ⋮ PARTITIONS OF COMPLETE BIPARTITE GEOMETRIC GRAPHS INTO PLANE PERFECT MATCHINGS ⋮ Spanning tree packing number and eigenvalues of graphs with given girth ⋮ On the extended Clark-Wormold Hamiltonian-like index problem ⋮ Unnamed Item ⋮ Clustering analysis of a dissimilarity: a review of algebraic and geometric representation ⋮ Up-embeddability via girth and the degree-sum of adjacent vertices ⋮ Maximum genus, girth and connectivity ⋮ The connectivity of acyclic orientation graphs ⋮ On chromatic number and minimum cut ⋮ Heffter arrays and biembedding graphs on surfaces ⋮ Lower bounds on the maximum genus of loopless multigraphs ⋮ Edge Partition of Toroidal Graphs into Forests in Linear Time ⋮ A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs ⋮ Spanning trails containing given edges

Cites Work

• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Minimal k‐arc connected graphs
• Existence of k-edge connected ordinary graphs with prescribed degrees

This page was built for publication: Bounds of the number of disjoint spanning trees