scientific article; zbMATH DE number 3882481
From MaRDI portal
Publication:3216697
zbMATH Open0554.05052MaRDI QIDQ3216697FDOQ3216697
Authors: C. Berge 
Publication date: 1984
Title of this publication is not available (Why is that?)
Recommendations
- A note on the duality between matchings and vertex covers in balanced hypergraphs
- Normal hypergraphs and the perfect graph conjecture. (Reprint)
- scientific article; zbMATH DE number 863476
- Hall's and Kőnig's theorem in graphs and hypergraphs
- Perfect matchings in balanced hypergraphs---a combinatorial approach
minimax theoremsMenger propertybalanced hypergraphsnormal hypergraphsLovász's lemmaparanormal property
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Polytopes and polyhedra (52Bxx) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (13)
- Structural properties and decomposition of linear balanced matrices
- Perfect graphs are kernel solvable
- Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
- Directed hypergraphs and applications
- A note on the duality between matchings and vertex covers in balanced hypergraphs
- Kernels by properly colored paths in arc-colored digraphs
- Minimax relations for the partial q-colorings of a graph
- Perfect graphs, kernels, and cores of cooperative games
- Kernels by rainbow paths in arc-colored tournaments
- Syntactic stochastic processes: definitions, models, and related inference problems
- Decomposition of balanced matrices
- Optimisation and hypergraph theory
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3216697)
