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.
- Almost integral polyhedra related to certain combinatorial optimization problems (Q1240148) (← links)
- Matroidal graphs (Q1244250) (← links)
- Classification de certaines matrices 0-1 (Q1245835) (← links)
- Critical perfect graphs and perfect 3-chromatic graphs (Q1245851) (← links)
- The matroids with the max-flow min-cut property (Q1245970) (← links)
- Infinite triangulated graphs (Q1247986) (← links)
- Trivially perfect graphs (Q1248531) (← links)
- On the perfect graph conjecture (Q1248633) (← links)
- Combinatorial designs related to the strong perfect graph conjecture (Q1255951) (← links)
- Solution of two fractional packing problems of Lovász (Q1260046) (← links)
- Induced matchings (Q1262877) (← links)
- Stable families of coalitions and normal hypergraphs (Q1277475) (← links)
- On the odd cycles of normal graphs (Q1293197) (← links)
- On the disc-structure of perfect graphs. I: The co-paw-structure (Q1293203) (← links)
- Edge-disjoint odd cycles in graphs with small chromatic numbers (Q1296141) (← links)
- Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers (Q1297441) (← links)
- Edge-choosability in line-perfect multigraphs (Q1301714) (← links)
- Enumerative aspects of certain subclasses of perfect graphs (Q1301836) (← links)
- Normal fraternally orientable graphs satisfy the strong perfect graph conjecture (Q1313857) (← links)
- Near-perfect matrices (Q1332310) (← links)
- New classes of Berge perfect graphs (Q1332433) (← links)
- Different capacities of a digraph (Q1334937) (← links)
- Perfect graphs with no \(P_ 5\) and no \(K_ 5\) (Q1334944) (← links)
- Complexity of list coloring problems with a fixed total number of colors (Q1348378) (← links)
- On a class of square-free graphs (Q1350762) (← links)
- Motivations and history of some of my conjectures (Q1356729) (← links)
- On perfect \(0,\pm 1\) matrices (Q1356731) (← links)
- Path parity and perfection (Q1356748) (← links)
- Perfect graphs with unique \(P_ 4\)-structure (Q1356763) (← links)
- Fractional and integral colourings (Q1363414) (← links)
- Optimal channel allocation for several types of cellular radio networks (Q1372738) (← links)
- Chair-free Berge graphs are perfect (Q1376074) (← links)
- On a conjecture about uniquely colorable perfect graphs (Q1377674) (← links)
- On essential components and critical sets of a graph (Q1377850) (← links)
- On the closure of graphs under substitution (Q1377871) (← links)
- The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q1383368) (← links)
- Packing boxes with harmonic bricks (Q1393253) (← links)
- On certain polytopes associated with graphs (Q1393418) (← links)
- A class of perfect graphs containing \(P_{6}\) (Q1405124) (← links)
- Graph covers using \(t\)-colourable vertex sets. (Q1427470) (← links)
- Quasi-star-cutsets and some consequences (Q1600840) (← links)
- An efficient algorithm for solving the homogeneous set sandwich problem (Q1607076) (← links)
- The graph sandwich problem for 1-join composition is NP-complete (Q1613390) (← links)
- Hall's and Kőnig's theorem in graphs and hypergraphs (Q1660258) (← links)
- On box-perfect graphs (Q1682206) (← links)
- Partially concurrent open shop scheduling with integral preemptions (Q1698281) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
- On the mixed set covering, packing and partitioning polytope (Q1751181) (← links)
- Fractional solutions for capacitated NTU-games, with applications to stable matchings (Q1751188) (← links)
- Hadwiger's conjecture and inflations of the Petersen graph (Q1759395) (← links)
