Pages that link to "Item:Q2553445"
From MaRDI portal
The following pages link to Normal hypergraphs and the perfect graph conjecture (Q2553445):
Displaying 50 items.
- Unavoidable induced subgraphs in large graphs with no homogeneous sets (Q256979) (← links)
- On the independence polynomial of the corona of graphs (Q260027) (← links)
- Some properties on the tensor product of graphs obtained by monogenic semigroups (Q272447) (← links)
- The homogeneous set sandwich problem (Q293307) (← links)
- A lower bound on the independence number of a graph in terms of degrees and local clique sizes (Q298956) (← links)
- Exploring the concept of perfection in 3-hypergraphs (Q299076) (← links)
- On CIS circulants (Q394314) (← links)
- On a graph of monogenic semigroups (Q395814) (← links)
- Complexity of independent set reconfigurability problems (Q441866) (← links)
- Substitution and \(\chi\)-boundedness (Q461725) (← links)
- Coloring perfect graphs with no balanced skew-partitions (Q490982) (← links)
- Hadwiger's conjecture for inflations of 3-chromatic graphs (Q499451) (← links)
- Perfect zero-divisor graphs (Q507501) (← links)
- Excluding paths and antipaths (Q520043) (← links)
- Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree (Q548676) (← links)
- Cyclic orders (Q583246) (← links)
- Rainbow generalizations of Ramsey theory: A survey (Q604649) (← links)
- Optimal guard sets and the Helly property (Q607361) (← links)
- Substitution-closed pattern classes (Q618290) (← links)
- Well-covered circulant graphs (Q626761) (← links)
- On the behavior of the \(N_{+}\)-operator under blocker duality (Q628328) (← links)
- How to guard a graph? (Q652526) (← links)
- An algorithm for finding homogeneous pairs (Q674438) (← links)
- Preperfect graphs (Q684406) (← links)
- On generalized perfect graphs: Bounded degree and bounded edge perfection (Q686267) (← links)
- Bounded vertex colorings of graphs (Q686481) (← links)
- Lehman's forbidden minor characterization of ideal 0-1 matrices (Q686505) (← links)
- Some remarks on Hajós' conjecture (Q707025) (← links)
- Approximability of clique transversal in perfect graphs (Q724231) (← links)
- A min-max relation for the partial q-colourings of a graph. II: Box perfection (Q752726) (← links)
- Mind the independence gap (Q776261) (← links)
- Tolerance graphs (Q798675) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- The pair completion algorithm for the homogeneous set sandwich problem (Q844163) (← links)
- All minimal prime extensions of hereditary classes of graphs (Q868943) (← links)
- Entropy of symmetric graphs (Q898092) (← links)
- On the closure of triangle-free graphs under substitution (Q915449) (← links)
- Fair cost allocations under conflicts - a game-theoretic point of view - (Q924627) (← links)
- Rees algebras and polyhedral cones of ideals of vertex covers of perfect graphs (Q925305) (← links)
- The complexity of recognizing linear systems with certain integrality properties (Q927158) (← links)
- The Erdős-Hajnal conjecture for bull-free graphs (Q958690) (← links)
- Not complementary connected and not CIS \(d\)-graphs form weakly monotone families (Q966046) (← links)
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited (Q967361) (← links)
- A note on kernels and Sperner's Lemma (Q967389) (← links)
- A polyhedral approach to the stability of a family of coalitions (Q968155) (← links)
- A magnetic procedure for the stability number (Q968215) (← links)
- Constructions for normal graphs and some consequences (Q1003480) (← links)
- Duality for semiantichains and unichain coverings in products of special posets (Q1013994) (← links)
- Game-perfect graphs (Q1014302) (← links)
- A note on finding all homogeneous set sandwiches (Q1014412) (← links)
