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
- Some sequences associated with combinatorial structures
- Perfect couples of graphs
- Two-colorable graph states with maximal Schmidt measure
- Preperfect graphs
- On generalized perfect graphs: Bounded degree and bounded edge perfection
- Hadwiger's conjecture and inflations of the Petersen graph
- Perfect, ideal and balanced matrices
- A mickey-mouse decomposition theorem
- Perfectness of \(G\)-generalized join of graphs
- A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant
- Path parity and perfection
- Implosive graphs: square-free monomials on symbolic Rees algebras
- Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets
- Normal fraternally orientable graphs satisfy the strong perfect graph conjecture
- Lehman's forbidden minor characterization of ideal 0-1 matrices
- A new property of critical imperfect graphs and some consequences
- Tolerance graphs
- Perfect digraphs
- Lift-and-project ranks and antiblocker duality
- Quasi-star-cutsets and some consequences
- On the closure of triangle-free graphs under substitution
- Game-perfect graphs
- Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
- The graph sandwich problem for 1-join composition is NP-complete
- Odd cycles and matrices with integrality properties
- Critical perfect graphs and perfect 3-chromatic graphs
- Generalized perfect graphs: Characterizations and inversion
- Approximability of clique transversal in perfect graphs
- On a conjecture of Meyniel
- Cyclic orders
- On the perfect graph conjecture
- Relaxations of vertex packing
- Optimal guard sets and the Helly property
- Substitution and \(\chi\)-boundedness
- Gallai colorings and domination in multipartite digraphs
- Balanced matrices
- 2-clique-bond of stable set polyhedra
- Vertex- and edge-minimal and locally minimal graphs
- Covering, Packing and Generalized Perfection
- Minimax relations for the partial q-colorings of a graph
- Two double poset polytopes
- Substitution-closed pattern classes
- A min-max relation for the partial q-colourings of a graph. II: Box perfection
- Skew partition sandwich problem is NP-complete
- A Class of Balanced Matrices Arising from Location Problems
- All minimal prime extensions of hereditary classes of graphs
- On the strong perfect graph conjecture
- Coflow polyhedra
- The facets and the symmetries of the approval-voting polytope
- On a conjecture about uniquely colorable perfect 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)
