scientific article; zbMATH DE number 3363617

From MaRDI portal
Revision as of 04:12, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5636932

zbMath0229.05136MaRDI QIDQ5636932

Michel Las Vergnas

Publication date: 1970


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (27)

A note on the duality between matchings and vertex covers in balanced hypergraphsHall's and Kőnig's theorem in graphs and hypergraphsThe skiving stock problem and its relation to hypergraph matchingsMatchings and transversals in hypergraphs, domination and independence in treesBalanced \(0,\pm 1\)-matrices, bicoloring and total dual integralityOn some graph classes related to perfect graphs: a surveyPacking boxes with harmonic bricksVariations of maximum-clique transversal sets on graphsBalanced matricesStandard graded vertex cover algebras, cycles and leavesStructural properties and decomposition of linear balanced matricesPartial characterizations of clique-perfect graphs I: Subclasses of claw-free graphsPerfect, ideal and balanced matricesNormal hypergraphs and the perfect graph conjecture. (Reprint)Clique-perfectness of complements of line graphsMatchings and covers in hypergraphsOptimisation and hypergraph theoryPartial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphsMaximale stabile Punktmengen und minimale Überdeckungen gleichgewichtiger HypergraphenMinimax relations for the partial q-colorings of a graphDecomposition of balanced matricesNormal hypergraphs and the perfect graph conjecturePerfect matchings in balanced hypergraphsPacking and covering of crossing families of cutsSome hypergraphs and packing problems associated with matrices of O's and 1'sOn balanced graphsBalanced matrices







This page was built for publication: