Normal hypergraphs and the perfect graph conjecture

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Anti-blocking polyhedra
Title not available (Why is that?)

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

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
Some properties on the disjunctive product over graphs of monogenic semigroups
Convex-round graphs are circular-perfect
A semi-strong perfect graph theorem
On stable set polyhedra for K//(1,3)free graphs
New classes of Berge perfect graphs
Almost integral polyhedra related to certain combinatorial optimization problems
The matroids with the max-flow min-cut property
A polyhedral approach to the stability of a family of coalitions
Polyhedral proof methods in combinatorial optimization
Motivations and history of some of my conjectures
Perfect graphs, kernels, and cores of cooperative games
The maximum vertex coverage problem on bipartite graphs
The \(k\)-dominating graph
An efficient algorithm for solving the homogeneous set sandwich problem
Matchings and covers in hypergraphs
An integer analogue of Carathéodory's theorem
On the dot product of graphs over monogenic semigroups
Comparing imperfection ratio and imperfection index for graph classes
Some partitions associated with a partially ordered set
A combinatorial approach to nonlocality and contextuality
Recognizing bull-free perfect graphs
On CIS circulants
Applying Lehman's theorems to packing problems
Some properties on the lexicographic product of graphs obtained by monogenic semigroups
Optimal channel allocation for several types of cellular radio networks
Induced subgraphs of graphs with large chromatic number. VII: Gyárfás' complementation conjecture
Fractional solutions for capacitated NTU-games, with applications to stable matchings
Some remarks on Hajós' conjecture
Compositions for perfect graphs
On the linear extension complexity of stable set polytopes for perfect graphs
Fair cost allocations under conflicts - a game-theoretic point of view -
Integer Rounding for Polymatroid and Branching Optimization Problems
Not complementary connected and not CIS \(d\)-graphs form weakly monotone families
Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
The \(A_4\)-structure of a graph
Constructions for normal graphs and some consequences
Star-cutsets and perfect graphs
Some properties of minimal imperfect graphs
On the odd cycles of normal graphs
The Erdős-Hajnal conjecture for bull-free graphs
Properties of vertex packing and independence system polyhedra
Perfect graphs and guarding rectilinear art galleries
Edmonds polytopes and a hierarchy of combinatorial problems
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

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)