Fractional arboricity, strength, and principal partitions in graphs and matroids

DOI10.1016/0166-218X(92)90002-RzbMath0773.05033MaRDI QIDQ1208447

Arthur M. Hobbs, Hong-Jian Lai, Paul A. Catlin, Jerrold W. Grossman

Publication date: 16 May 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

strength; matroid; fractional arboricity; principal partition

Mathematics Subject Classification ID

05B35: Combinatorial aspects of matroids and geometric lattices

05C99: Graph theory

Related Items

Unnamed Item, Duality in graph families, Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness, Strength and fractional arboricity of complementary graphs, Every matroid is a submatroid of a uniformly dense matroid

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
• The reduction of graph families closed under contraction
• The principal minors of a matroid
• Connectivity and edge-disjoint spanning trees
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Activities on circuit theory in Japan
• Optimal attack and reinforcement of a network
• Strongly balanced graphs and random graphs
• A Solution of the Shannon Switching Game
• Lehmans switching game and a theorem of Tutte and Nash-Williams
• PRINCIPAL PARTITION AND PRINCIPAL MINORS OF A MATROID, WITH APPLICATIONS†
• Decomposition of Finite Graphs Into Forests