scientific article; zbMATH DE number 3522018

zbMATH Open0334.05117MaRDI QIDQ4099676FDOQ4099676

Authors: C. Berge 

Publication date: 1970

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Integer programming (90C10) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Cited In (only showing first 100 items - show all)

• Dominating cliques in chordal graphs
• Mutual placement of bipartite graphs
• On unique independent sets in graphs
• Graphs and free partially commutative monoids
• ERCW PRAMs and optical communication
• A characterization of \(P_{4}\)-comparability graphs
• Universal sequences for complete graphs
• Asymptotic values of the Hall-ratio for graph powers
• Kernels and perfectness in arc-local tournament digraphs
• On hypergraphs having evenly distributed subhypergraphs
• Extremal perfect graphs for a bound on the domination number
• Coloring perfect degenerate graphs
• A note on Farin points for rational triangular Bézier patches
• Adamant digraphs
• Bounds of the longest directed cycle length for minimal strong digraphs
• Linear programs for constraint satisfaction problems
• A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity
• On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\)
• A global parallel algorithm for the hypergraph transversal problem
• About colorings, stability and paths in directed graphs
• The complexity of matching with bonds
• Hypergraphs and the Clar problem in hexagonal systems
• Sequential colorings and perfect graphs
• Cube intersection concepts in median graphs
• Sequentially rejective pairwise testing procedures
• A new method to extend kernel-perfect graphs to kernel-perfect critical graphs
• Cost colourings of hypergraphs
• Minimum partition of an independence system into independent sets
• Boundary of Hurwitz spaces and explicit patching
• A sequential coloring algorithm for finite sets
• A bicriterion objective for levelling the schedule of a mixed-model, \(JIT\) assembly process
• Integer programs for logic constraint satisfaction
• Minimax relations for the partial q-colorings of a graph
• Efficient algorithms for wavelength assignment on trees of rings
• Algorithmic and explicit determination of the Lovász number for certain circulant graphs
• Kernels in pretransitive digraphs.
• Packing and covering k-chain free subsets in Boolean lattices
• A class of hypergraphs satisfying an inequality of Lovasz
• Open shop, satellite communication and a theorem by Egerváry (1931)
• Connected sequential colourings
• Ensembles d'articulation d'un graphe \(\gamma\)-critique
• Line hypergraphs
• On a conjecture for the university timetabling problem
• Infinite kernel perfect digraphs
• Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
• A characterization of cube-hypergraphs
• Antitwins in partitionable graphs
• An implementation of the iterative proportional fitting procedure by propagation trees.
• Extending kernel perfect digraphs to kernel perfect critical digraphs
• On some decision problems for trace codings
• Analysis of approximate algorithms for edge-coloring bipartite graphs
• Qualitative independence and Sperner problems for directed graphs
• Bounds for the covering number of a graph
• Introduction to fuzzy hypergraphs and Hebbian structures
• A class of perfectly contractile graphs
• Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry
• Kernels and some operations in edge-coloured digraphs
• Numerical characterization of \(n\)-cube subset partitioning
• Transitive orientations in bull-reducible Berge graphs
• Claw-free cubic graphs with clique-transversal number half of their order
• Total dominating sequences in graphs
• On the complexity of monotone dualization and generating minimal hypergraph transversals
• Spectra of uniform hypergraphs
• A new characterization of perfect graphs
• Finding intersection models: from chordal to Helly circular-arc graphs
• The complexity of arc-colorings for directed hypergraphs
• Clique-transversal sets and clique-coloring in planar graphs
• A characterization of Delsarte's linear programming bound as a ratio bound
• A characterization of normal fraternally orientable perfect graphs
• Dominating sequences in graphs
• The order-interval hypergraph of a finite poset and the König property
• Independent sets in bounded-degree hypergraphs
• Tensors, matchings and codes
• Reformulation of global constraints based on constraints checkers
• Kernels by monochromatic paths in digraphs with covering number 2
• Kernels in edge-coloured orientations of nearly complete graphs
• The polytope of degree sequences of hypergraphs
• Kernels in a special class of digraphs
• On the complexity of Slater's problems
• \(k\)-Ordered Hamilton cycles in digraphs
• Interactive image segmentation using probabilistic hypergraphs
• \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs
• A survey on the complexity of tournament solutions
• A generalization of antiwebs to independence systems and their canonical facets
• Fuzzy colorings of fuzzy hypergraphs
• A unified treatment of nearly reducible and nearly decomposable matrices
• Some sufficient conditions for the existence of kernels in infinite digraphs
• On the SPANNING \(k\)-TREE problem
• Finding explanations of inconsistency in multi-context systems
• On panchromatic patterns
• Finite families of forbidden subgraphs for rainbow connection in graphs
• On minimally \(b\)-imperfect graphs
• Essential points of the \(n\)-cube subset partitioning characterisation
• XSAT and NAE-SAT of linear CNF classes
• Independent sets which meet all longest paths
• Matrices of zeros and ones with fixed row and column sum vectors
• Maximum number of edges in connected graphs with a given domination number
• A note on greedy algorithms for the maximum weighted independent set problem
• The algorithmic use of hypertree structure and maximum neighbourhood orderings
• Solving efficiently the 0-1 multi-objective knapsack problem

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 Q4099676)