Normal hypergraphs and the perfect graph conjecture
From MaRDI portal
Publication:2553445
Cites work
Cited in
(only showing first 100 items - show all)- Some sequences associated with combinatorial structures
- Unavoidable induced subgraphs in large graphs with no homogeneous sets
- Perfect couples of graphs
- Graphical properties related to minimal imperfection
- Independence polynomials of circulants with an application to music
- Triangle-free strongly circular-perfect graphs
- Two-colorable graph states with maximal Schmidt measure
- Packing boxes with harmonic bricks
- Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree
- Preperfect graphs
- On generalized perfect graphs: Bounded degree and bounded edge perfection
- Two-colourings that decompose perfect graphs
- On maximum independent set of categorical product and ultimate categorical ratios of graphs
- Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture
- How to guard a graph?
- A note on the semi-strong perfect graph conjecture
- On the independence polynomial of the corona of graphs
- Well-covered circulant graphs
- Testing consumer rationality using perfect graphs and oriented discs
- A lower bound on the independence number of a graph in terms of degrees and local clique sizes
- Strongly balanced cooperative games
- Matrix partitions of perfect graphs
- Hadwiger's conjecture and inflations of the Petersen graph
- Combinatorial symbolic powers
- Structure of cubic Lehman matrices
- Classification de certaines matrices 0-1
- A note on kernels and Sperner's Lemma
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs
- Murky graphs
- No antitwins in minimal imperfect graphs
- Perfect, ideal and balanced matrices
- A note on perfect graphs
- Coloring perfect graphs with no balanced skew-partitions
- Polyhedral sets and integer rounding
- A magnetic procedure for the stability number
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem
- \(\alpha\)-diperfect digraphs
- On dart-free perfectly contractile graphs
- Some properties on the tensor product of graphs obtained by monogenic semigroups
- Maximum degree and fractional matchings in uniform hypergraphs
- Path parity and perfection
- A mickey-mouse decomposition theorem
- Perfectness of \(G\)-generalized join of graphs
- Matroidal graphs
- A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant
- Locally perfect graphs
- Wings and perfect graphs
- Decomposition of perfect graphs
- On a graph of monogenic semigroups
- A class of perfect graphs containing \(P_{6}\)
- Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets
- Normal fraternally orientable graphs satisfy the strong perfect graph conjecture
- Solution of two fractional packing problems of Lovász
- Lehman's forbidden minor characterization of ideal 0-1 matrices
- On slim graphs, even pairs, and star-cutsets
- Point partition numbers: perfect graphs
- Orientable burning number of graphs
- Implosive graphs: square-free monomials on symbolic Rees algebras
- A new property of critical imperfect graphs and some consequences
- Excluding induced subdivisions of the bull and related graphs
- Stable families of coalitions and normal hypergraphs
- Detecting strong cliques
- Tolerance graphs
- Forbidden subgraphs of power graphs
- Combinatorial designs related to the strong perfect graph conjecture
- Bull-free Berge graphs are perfect
- The strong perfect graph conjecture for pan-free graphs
- Geometric inequalities for anti-blocking bodies
- PERFECTION IN R-PROCESSES
- Lift-and-project ranks and antiblocker duality
- Small 1-defective Ramsey numbers in perfect graphs
- Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach
- Perfect digraphs
- On the closure of triangle-free graphs under substitution
- Quasi-star-cutsets and some consequences
- Game-perfect graphs
- Perfect zero–one matrices
- Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
- Near-perfect matrices
- On the combinatorial problems which I would most like to see solved
- The ellipsoid method and its consequences in combinatorial optimization
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)
- A class of facet producing graphs for vertex packing polyhedra
- Graph imperfection. I
- On the ratio of optimal integral and fractional covers
- Rainbow generalizations of Ramsey theory: A survey
- On the complement of the zero-divisor graph of a partially ordered set
- Graph covers using \(t\)-colourable vertex sets.
- The graph sandwich problem for 1-join composition is NP-complete
- Polynomial algorithms for a class of linear programs
- Odd cycles and matrices with integrality properties
- Critical perfect graphs and perfect 3-chromatic graphs
- Two classes of perfect graphs
- Infinite triangulated graphs
- Partially concurrent open shop scheduling with integral preemptions
- On certain polytopes associated with graphs
- Generalized perfect graphs: Characterizations and inversion
- Approximability of clique transversal in perfect graphs
- Solution of two fractional packing problems of Lovász. (Reprint)
- Graphs with at most two moplexes
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)
