Adjacent vertices on the b-matching polyhedron

DOI10.1016/0012-365X(81)90256-9MaRDI QIDQ1156817zbMATH OpenFDO

Authors Dirk Hausmann

Publication date 1981

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(81)90256-9

zbMATH Keywords

b-matchingcolouring criterion

Mathematics Subject Classification ID

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

Cites work

• Characterizations of adjacency on the branching polyhedron
• scientific article; zbMATH DE number 3427118 (Why is no real title available?)
• scientific article; zbMATH DE number 3659288 (Why is no real title available?)
• scientific article; zbMATH DE number 3687081 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3499169 (Why is no real title available?)
• scientific article; zbMATH DE number 3609444 (Why is no real title available?)
• scientific article; zbMATH DE number 3628719 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Maximum matching and a polyhedron with 0,1-vertices
• On certain polytopes associated with graphs

Cited in

(3)

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

This page was built for publication: Adjacent vertices on the b-matching polyhedron

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