scientific article; zbMATH DE number 3363617
From MaRDI portal
Publication:5636932
Cited in
(28)- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- Structural properties and decomposition of linear balanced matrices
- Packing boxes with harmonic bricks
- Decomposition of balanced matrices
- Hall's and Kőnig's theorem in graphs and hypergraphs
- The skiving stock problem and its relation to hypergraph matchings
- Matchings and covers in hypergraphs
- Optimisation and hypergraph theory
- Minimax relations for the partial q-colorings of a graph
- Some hypergraphs and packing problems associated with matrices of O's and 1's
- Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
- On some graph classes related to perfect graphs: a survey
- Variations of maximum-clique transversal sets on graphs
- Balanced matrices
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
- Normal hypergraphs and the perfect graph conjecture. (Reprint)
- Maximale stabile Punktmengen und minimale Überdeckungen gleichgewichtiger Hypergraphen
- Normal hypergraphs and the perfect graph conjecture
- Perfect matchings in balanced hypergraphs
- On balanced graphs
- A note on the duality between matchings and vertex covers in balanced hypergraphs
- Standard graded vertex cover algebras, cycles and leaves
- Balanced matrices
- Clique-perfectness of complements of line graphs
- Perfect, ideal and balanced matrices
- Matchings and transversals in hypergraphs, domination and independence in trees
- Helly groups
- Packing and covering of crossing families of cuts
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 Q5636932)
