Brick decompositions and the matching rank of graphs
From MaRDI portal
Publication:1055426
DOI10.1007/BF02579233zbMath0521.05035MaRDI QIDQ1055426
László Lovász, Jack Edmonds, William R. Pulleyblank
Publication date: 1982
Published in: Combinatorica (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Linear programming (90C05) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
A note on tight cuts in matching-covered graphs, On cycle-nice claw-free graphs, On Two Unsolved Problems Concerning Matching Covered Graphs, Grid graphs, Gorenstein polytopes, and domino stackings, Undirected distances and the postman-structure of graphs, The Schrijver system of odd join polyhedra, Generating bricks, Matching structure and the matching lattice, Bicritical graphs without removable edges, Erdős-Ko-Rado for perfect matchings, Perfect matchings and ears in elementary bipartite graphs, Removable ears of 1-extendable graphs, Average connectivity and average edge-connectivity in graphs, Three-matching intersection conjecture for perfect matching polytopes of small dimensions, A generalization of Little's theorem on Pfaffian orientations, On extremal nonsolid bricks, Matching connectivity: on the structure of graphs with perfect matchings, A superlinear bound on the number of perfect matchings in cubic bridgeless graphs, Core index of perfect matching polytope for a 2-connected cubic graph, Generating simple near‐bipartite bricks, The cubic vertices of solid minimal bricks, Minimum degree of minimal \((n-10)\)-factor-critical graphs, How to build a brick, Facet Generating Techniques, Minimal bricks have many vertices of small degree, Birkhoff--von Neumann Graphs that are PM-Compact, Randomly colouring graphs (a combinatorial view), Disjoint Odd Cycles in Cubic Solid Bricks, An algorithm to find the lineality space of the positive hull of a set of vectors, Efficient edge-skeleton computation for polytopes defined by oracles, Minimally non-Pfaffian graphs, Pfaffian labelings and signs of edge colorings, On integer points in polyhedra, Matching theory -- a sampler: From Dénes König to the present, The Cubic Vertices of Minimal Bricks, A branch-and-cut procedure for the Udine course timetabling problem, An improved linear bound on the number of perfect matchings in cubic graphs, Exponentially many perfect matchings in cubic graphs, Minimal bricks, Brace generation, On generalizations of matching-covered graphs, Construction for bicritical graphs and \(k\)-extendable bipartite graphs, On the number of dissimilar pfaffian orientations of graphs, A Matlab-based rapid method for computing lattice-subspaces and vector sublattices of \(\mathbb R^n\): applications in portfolio insurance, Laminar tight cuts in matching covered graphs, On essentially 4-edge-connected cubic bricks, K 4 -free and C6¯-free Planar Matching Covered Graphs, \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks, Toughness and matching extension in graphs, Relations between global forcing number and maximum anti-forcing number of a graph, Graft analogue of general Kotzig-Lovász decomposition, Cubic bridgeless graphs have more than a linear number of perfect matchings, Optimal ear decompositions of matching covered graphs and bases for the matching lattice, Permutohedra and minimal matrices, Extending matchings in graphs: A survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On maximal independent sets of vertices in claw-free graphs
- Matchings in regular graphs
- The ellipsoid method and its consequences in combinatorial optimization
- Matroid Intersection
- Dual integrality in b-matching problems
- Rank of maximum matchings in a graph
- Paths, Trees, and Flowers
- Maximum matching and a polyhedron with 0,1-vertices
- Systems of distinct representatives and linear algebra
- On the structure of factorizable graphs
