Optimisation and hypergraph theory

DOI10.1016/0377-2217(90)90004-UzbMath0746.05047OpenAlexW2028932094MaRDI 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

hypergraphHelly propertycombinatorial optimisationKönig propertybicolorability propertycolored edge property

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

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

Cites Work

• 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
• 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

This page was built for publication: Optimisation and hypergraph theory