scientific article; zbMATH DE number 5499264

MaRDI QIDQ5506265zbMATH OpenFDO

Authors Matthias Kriesell

Publication date 28 January 2009

zbMATH Keywords

base packingdecompositiondisjoint basesfactorizationHenneberg operationsspanning tree

Mathematics Subject Classification ID

Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Recommendations

• Edge‐disjoint spanning trees: A connectedness theorem
• Edge-disjoint spanning trees and forests of graphs
• Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs.
• A property on edge-disjoint spanning trees
• Spanning \(k\)-trees of \(n\)-connected graphs
• Edge-disjoint spanning trees and eigenvalues of graphs
• Edge-disjoint spanning trees, edge connectivity, and eigenvalues in graphs
• On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph
• scientific article; zbMATH DE number 31498
• Edge-disjoint spanning trees and eigenvalues of regular graphs

Cited in

(5)

• Constructive characterizations for packing and covering with trees
• Balancing two spanning trees
• scientific article; zbMATH DE number 31498 (Why is no real title available?)
• scientific article; zbMATH DE number 1757954 (Why is no real title available?)
• On constructive characterizations of (k,l)-sparse graphs

This page was built for publication:

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