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

DOI10.1016/0166-218X(94)00148-7MaRDI QIDQ1900140zbMATH OpenOpenAlexFDO

Authors 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 graphinduced subgraphwheelholebalancedparachute

Mathematics Subject Classification ID

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

Recommendations

• Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs
• The (theta, wheel)-free graphs. IV: Induced paths and cycles
• Graphs with no induced wheel and no induced antiwheel
• The (theta, wheel)-free graphs. II: Structure theorem

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• A Combinatorial Decomposition Theory
• A sufficient condition for a matrix to be totally unimodular
• Alpha-balanced graphs and matrices and GF(3)-representability of matroids
• Balanced matrices
• Characterizations of totally balanced matrices
• Decomposition of regular matroids
• Odd cycles and matrices with integrality properties
• On a Class of Totally Unimodular Matrices
• Perfect Elimination and Chordal Bipartite Graphs
• Structural properties and decomposition of linear balanced matrices
• Structural properties and recognition of restricted and strongly unimodular matrices
• Totally-Balanced and Greedy Matrices

Cited in

(1)

• Some new clique inequalities in four-index hub location models

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

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