Normal hypergraphs and the perfect graph conjecture
From MaRDI portal
Publication:2553445
DOI10.1016/0012-365X(72)90006-4zbMATH Open0239.05111OpenAlexW1997998268WikidataQ55869517 ScholiaQ55869517MaRDI QIDQ2553445FDOQ2553445
Authors: László Lovász 
Publication date: 1972
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(72)90006-4
Extremal problems in graph theory (05C35) Integer programming (90C10) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)
Cites Work
Cited In (only showing first 100 items - show all)
- Graphical properties related to minimal imperfection
- Packing boxes with harmonic bricks
- Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture
- A note on the semi-strong perfect graph conjecture
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs
- Murky graphs
- No antitwins in minimal imperfect graphs
- On dart-free perfectly contractile graphs
- A magnetic procedure for the stability number
- Locally perfect graphs
- Wings and perfect graphs
- On slim graphs, even pairs, and star-cutsets
- Detecting strong cliques
- Stable families of coalitions and normal hypergraphs
- On the complement of the zero-divisor graph of a partially ordered set
- Infinite triangulated graphs
- Two classes of perfect graphs
- Partially concurrent open shop scheduling with integral preemptions
- Zur Theorie der perfekten Graphen
- On line perfect graphs
- Edge-choosability in line-perfect multigraphs
- The intersection of two vertex coloring problems
- Chair-free Berge graphs are perfect
- On box-perfect graphs
- Characterizations of \((4 K_1,C_4,C_5)\)-free graphs
- On fully orientability of 2-degenerate graphs
- Discrete extremal problems
- Duality for semiantichains and unichain coverings in products of special posets
- On some graph classes related to perfect graphs: a survey
- Finite checkability for integer rounding properties in combinatorial programming problems
- On the sibling-structure of perfect graphs
- A notion of cross-perfect bipartite graphs
- Edge-colouring of regular graphs of large degree
- Complexity of list coloring problems with a fixed total number of colors
- Amalgams and \(\chi\)-boundedness
- On circular-perfect graphs: a survey
- Graph imperfection. II
- Random perfect graphs
- The convex hull of antichains in posets
- On a geometric property of perfect graphs
- Perfectness and Dilworth number
- On a Class of P 5 -Free Graphs
- Perfect graphs with no \(P_ 5\) and no \(K_ 5\)
- Characterizing intersection classes of graphs
- Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint)
- Uniquely colorable perfect graphs
- Probabilistic refinement of the asymptotic spectrum of graphs
- Minimal imperfect graphs: A simple approach
- Graphs defined on groups
- On box totally dual integral polyhedra
- Unavoidable induced subgraphs in large graphs with no homogeneous sets
- Independence polynomials of circulants with an application to music
- Triangle-free strongly circular-perfect graphs
- Two-colourings that decompose perfect graphs
- Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree
- How to guard a graph?
- Matrix partitions of perfect graphs
- Well-covered circulant graphs
- On the independence polynomial of the corona of graphs
- Strongly balanced cooperative games
- Combinatorial symbolic powers
- A lower bound on the independence number of a graph in terms of degrees and local clique sizes
- A note on kernels and Sperner's Lemma
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem
- A note on perfect graphs
- Coloring perfect graphs with no balanced skew-partitions
- Maximum degree and fractional matchings in uniform hypergraphs
- Some properties on the tensor product of graphs obtained by monogenic semigroups
- Matroidal graphs
- Decomposition of perfect graphs
- On a graph of monogenic semigroups
- Combinatorial designs related to the strong perfect graph conjecture
- Bull-free Berge graphs are perfect
- The strong perfect graph conjecture for pan-free graphs
- Perfect zero–one matrices
- Near-perfect matrices
- On the combinatorial problems which I would most like to see solved
- The ellipsoid method and its consequences in combinatorial optimization
- Graph imperfection. I
- A class of facet producing graphs for vertex packing polyhedra
- On the ratio of optimal integral and fractional covers
- Rainbow generalizations of Ramsey theory: A survey
- On certain polytopes associated with graphs
- The homogeneous set sandwich problem
- Exploring the concept of perfection in 3-hypergraphs
- Trivially perfect graphs
- Exploring the relationship between max-cut and stable set relaxations
- Perfectness of clustered graphs
- Stable effectivity functions and perfect graphs
- On the behavior of the \(N_{+}\)-operator under blocker duality
- Complexity of independent set reconfigurability problems
- Edge colorings of complete graphs without tricolored triangles
- Induced matchings
- On algorithms for (\(P_5\), gem)-free graphs
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- The pair completion algorithm for the homogeneous set sandwich problem
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs
- The complexity of recognizing linear systems with certain integrality properties
- A note on finding all homogeneous set sandwiches
- On edge perfectness and classes of bipartite graphs
This page was built for publication: Normal hypergraphs and the perfect graph conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2553445)
