Normal hypergraphs and the perfect graph conjecture
From MaRDI portal
Publication:2553445
Cites work
Cited in
(only showing first 100 items - show all)- Constructions for normal graphs and some consequences
- Duality for semiantichains and unichain coverings in products of special posets
- Game-perfect graphs
- A note on finding all homogeneous set sandwiches
- Two-colorable graph states with maximal Schmidt measure
- Independence polynomials of circulants with an application to music
- Triangle-free strongly circular-perfect graphs
- A notion of cross-perfect bipartite graphs
- Vertex- and edge-minimal and locally minimal graphs
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- On a geometric property of perfect graphs
- Perfectness and Dilworth number
- Decomposition of perfect graphs
- Some sequences associated with combinatorial structures
- An integer analogue of Carathéodory's theorem
- Relaxations of vertex packing
- Characterizing intersection classes of graphs
- Polyhedral proof methods in combinatorial optimization
- A note on perfect graphs
- Bull-free Berge graphs are perfect
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs
- On a conjecture of Meyniel
- Murky graphs
- A semi-strong perfect graph theorem
- A new property of critical imperfect graphs and some consequences
- Locally perfect graphs
- No antitwins in minimal imperfect graphs
- Two classes of perfect graphs
- The strong perfect graph conjecture for pan-free graphs
- Wings and perfect graphs
- Star-cutsets and perfect graphs
- Some properties of minimal imperfect graphs
- Graphical properties related to minimal imperfection
- Zur Theorie der perfekten Graphen
- Discrete extremal problems
- A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs
- A classification of certain graphs with minimal imperfection properties
- On the combinatorial problems which I would most like to see solved
- On the strong perfect graph conjecture and critical graphs
- The ellipsoid method and its consequences in combinatorial optimization
- On stable set polyhedra for K//(1,3)free graphs
- Maximum degree and fractional matchings in uniform hypergraphs
- Strongly balanced cooperative games
- Perfect couples of graphs
- Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets
- Coflow polyhedra
- On slim graphs, even pairs, and star-cutsets
- The convex hull of antichains in posets
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- Some inequalities on the chromatic number of a graph
- A class of facet producing graphs for vertex packing polyhedra
- On the ratio of optimal integral and fractional covers
- Some partitions associated with a partially ordered set
- On formal fractions associated with the symmetric groups
- Almost integral polyhedra related to certain combinatorial optimization problems
- Matroidal graphs
- Classification de certaines matrices 0-1
- Critical perfect graphs and perfect 3-chromatic graphs
- The matroids with the max-flow min-cut property
- Infinite triangulated graphs
- Trivially perfect graphs
- On the perfect graph conjecture
- Combinatorial designs related to the strong perfect graph conjecture
- Solution of two fractional packing problems of Lovász
- Induced matchings
- Stable families of coalitions and normal hypergraphs
- On the odd cycles of normal graphs
- On the disc-structure of perfect graphs. I: The co-paw-structure
- Edge-disjoint odd cycles in graphs with small chromatic numbers
- Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers
- Edge-choosability in line-perfect multigraphs
- Enumerative aspects of certain subclasses of perfect graphs
- Normal fraternally orientable graphs satisfy the strong perfect graph conjecture
- Near-perfect matrices
- New classes of Berge perfect graphs
- Different capacities of a digraph
- Perfect graphs with no \(P_ 5\) and no \(K_ 5\)
- Complexity of list coloring problems with a fixed total number of colors
- On a class of square-free graphs
- Motivations and history of some of my conjectures
- On perfect \(0,\pm 1\) matrices
- Path parity and perfection
- Perfect graphs with unique \(P_ 4\)-structure
- Fractional and integral colourings
- Optimal channel allocation for several types of cellular radio networks
- Chair-free Berge graphs are perfect
- On a conjecture about uniquely colorable perfect graphs
- On essential components and critical sets of a graph
- On the closure of graphs under substitution
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- Packing boxes with harmonic bricks
- On certain polytopes associated with graphs
- A class of perfect graphs containing \(P_{6}\)
- Graph covers using \(t\)-colourable vertex sets.
- Quasi-star-cutsets and some consequences
- An efficient algorithm for solving the homogeneous set sandwich problem
- The graph sandwich problem for 1-join composition is NP-complete
- Hall's and Kőnig's theorem in graphs and hypergraphs
- On box-perfect graphs
- Partially concurrent open shop scheduling with integral preemptions
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)
