Adjacent vertices on the b-matching polyhedron

DOI10.1016/0012-365X(81)90256-9zbMath0469.05053MaRDI QIDQ1156817

Dirk Hausmann

Publication date: 1981

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

zbMATH Keywords

b-matchingcolouring criterion

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Characterizations of adjacency on the branching polyhedron, A matching problem with side conditions, Adjacency on polymatroids

Cites Work

• Characterizations of adjacency on the branching polyhedron
• On certain polytopes associated with graphs
• Maximum matching and a polyhedron with 0,1-vertices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item