Optimisation and hypergraph theory

DOI10.1016/0377-2217(90)90004-UzbMath0746.05047MaRDI QIDQ1813951

Claude Berge

Publication date: 25 June 1992

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(90)90004-u

zbMATH Keywords

hypergraph; Helly property; combinatorial optimisation; König property; bicolorability property; colored edge property

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

05C65: Hypergraphs

05C15: Coloring of graphs and hypergraphs

Related Items

Some properties of non-bicolorable hypergraphs and the four-color problem

Cites Work

• Une classe d'hypergraphes bichromatiques. II
• Characterizations of strongly chordal graphs
• Properties of (0,1)-matrices without certain configurations
• Strong unimodularity for matrices and hypergraphs
• Total unimodularity and combinatorial theorems
• Equipartite colorings in graphs and hypergraphs
• Hypergraphes arbores
• On a class of balanced hypergraphs
• Minimax relations for the partial q-colorings of a graph
• Normal hypergraphs and the perfect graph conjecture
• Degrees of acyclicity for hypergraphs and relational database schemes
• A Class of Balanced Matrices Arising from Location Problems
• Characterizations of totally balanced matrices
• On negative flows of the AKNS hierarchy and a class of deformations of a bihamiltonian structure of hydrodynamic type
• Totally-Balanced and Greedy Matrices
• On the existence of generalized good and equitable edge colorings
• Balanced matrices and property (G)
• Quasi-balanced matrices
• Ein kombinatorisches Problem von P. Erdős und A. Hajnal
• Balanced matrices
• On a combinatorial game
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item