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.
- Compositions for perfect graphs (Q2266722) (← links)
- On the sibling-structure of perfect graphs (Q2277483) (← links)
- The intersection of two vertex coloring problems (Q2303434) (← links)
- On the linear extension complexity of stable set polytopes for perfect graphs (Q2311370) (← links)
- Detecting strong cliques (Q2312812) (← links)
- Structure of cubic Lehman matrices (Q2325755) (← links)
- Suppression distance computation for hierarchical clusterings (Q2346561) (← links)
- On maximum independent set of categorical product and ultimate categorical ratios of graphs (Q2348262) (← links)
- Integer round-up property for the chromatic number of some \(h\)-perfect graphs (Q2364493) (← links)
- The story of perfectly orderable graphs (Q2373439) (← links)
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) (Q2373937) (← links)
- On fully orientability of 2-degenerate graphs (Q2380068) (← links)
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
- Characterizations of \((4 K_1,C_4,C_5)\)-free graphs (Q2403803) (← links)
- The Hadwiger number, chordal graphs and \(ab\)-perfection (Q2409752) (← links)
- On the dot product of graphs over monogenic semigroups (Q2423099) (← links)
- Bounding clique-width via perfect graphs (Q2424685) (← links)
- Alternatives for testing total dual integrality (Q2429472) (← links)
- Perfect graphs, kernels, and cores of cooperative games (Q2433701) (← links)
- Balanced matrices (Q2433704) (← links)
- Matrix partitions of perfect graphs (Q2433706) (← links)
- Sorting under partial information (without the ellipsoid algorithm) (Q2439837) (← links)
- 2-clique-bond of stable set polyhedra (Q2446841) (← links)
- The maximum vertex coverage problem on bipartite graphs (Q2448919) (← links)
- Edge-colouring of regular graphs of large degree (Q2465629) (← links)
- Combinatorial symbolic powers (Q2470395) (← links)
- Skew partitions in perfect graphs (Q2482110) (← links)
- Exploring the relationship between max-cut and stable set relaxations (Q2490329) (← links)
- Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint) (Q2497988) (← links)
- Solution of two fractional packing problems of Lovász. (Reprint) (Q2497997) (← links)
- Une classe d'hypergraphes bichromatiques (Q2555866) (← links)
- Edmonds polytopes and a hierarchy of combinatorial problems (Q2557712) (← links)
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs (Q2576772) (← links)
- Reconfiguration of colorable sets in classes of perfect graphs (Q2632018) (← links)
- Some properties on the lexicographic product of graphs obtained by monogenic semigroups (Q2637547) (← links)
- Two-colourings that decompose perfect graphs (Q2640608) (← links)
- Perfect graphs for domination games (Q2660136) (← links)
- Complementation in T-perfect graphs (Q2672429) (← links)
- Reconfiguration of cliques in a graph (Q2700609) (← links)
- Polyhedral sets and integer rounding (Q2741357) (← links)
- On Vertices and Facets of Combinatorial 2-Level Polytopes (Q2835675) (← links)
- Skew partition sandwich problem is NP-complete (Q2840508) (← links)
- Excluding induced subdivisions of the bull and related graphs (Q2911052) (← links)
- The \(A_4\)-structure of a graph (Q2911060) (← links)
- Counting List Matrix Partitions of Graphs (Q2944567) (← links)
- Amalgams and χ-Boundedness (Q2958199) (← links)
- Convex-round graphs are circular-perfect (Q3150195) (← links)
- Comparing Imperfection Ratio and Imperfection Index for Graph Classes (Q3163670) (← links)
- On perfect graphs and polyhedra with (0, 1)-valued extreme points (Q3208440) (← links)
- Covering, Packing and Generalized Perfection (Q3220635) (← links)
