Decomposition of wheel-and-parachute-free balanced bipartite graphs

DOI10.1016/0166-218X(94)00148-7zbMath0832.05063OpenAlexW2050059784MaRDI QIDQ1900140

Yanyan Li

Publication date: 8 February 1996

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

Full work available at URL: https://doi.org/10.1016/0166-218x(94)00148-7

zbMATH Keywords

bipartite graphholeinduced subgraphwheelbalancedparachute

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Decomposition of regular matroids
• Alpha-balanced graphs and matrices and GF(3)-representability of matroids
• Structural properties and decomposition of linear balanced matrices
• Odd cycles and matrices with integrality properties
• Characterizations of totally balanced matrices
• On a Class of Totally Unimodular Matrices
• Totally-Balanced and Greedy Matrices
• Structural properties and recognition of restricted and strongly unimodular matrices
• A Combinatorial Decomposition Theory
• A sufficient condition for a matrix to be totally unimodular
• Perfect Elimination and Chordal Bipartite Graphs
• Balanced matrices

This page was built for publication: Decomposition of wheel-and-parachute-free balanced bipartite graphs