Normal hypergraphs and the perfect graph conjecture
From MaRDI portal
Publication:2553445
Cites work
Cited in
(only showing first 100 items - show all)- The homogeneous set sandwich problem
- Exploring the concept of perfection in 3-hypergraphs
- The robust chromatic number of graphs
- On a conjecture of Meyniel
- Cyclic orders
- Zur Theorie der perfekten Graphen
- Trivially perfect graphs
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
- \(\mathcal Q\)-Ramsey classes of graphs
- A Sum of Squares Characterization of Perfect Graphs
- On the perfect graph conjecture
- On the mixed set covering, packing and partitioning polytope
- On the disc-structure of perfect graphs. I: The co-paw-structure
- Exploring the relationship between max-cut and stable set relaxations
- Perfectness of clustered graphs
- Domination in digraphs and their direct and Cartesian products
- On the behavior of the \(N_{+}\)-operator under blocker duality
- On minimal forbidden subgraph characterizations of balanced graphs
- Stable effectivity functions and perfect graphs
- Edge-choosability in line-perfect multigraphs
- Complexity of independent set reconfigurability problems
- Edge-disjoint odd cycles in graphs with small chromatic numbers
- Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers
- Bounding clique-width via perfect graphs
- The intersection of two vertex coloring problems
- Induced matchings
- On line perfect graphs
- Chair-free Berge graphs are perfect
- Coloring rings
- On box-perfect graphs
- Edge colorings of complete graphs without tricolored triangles
- Optimal guard sets and the Helly property
- On algorithms for (P₅, gem)-free graphs
- Relaxations of vertex packing
- Characterizations of \((4 K_1,C_4,C_5)\)-free graphs
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- The pair completion algorithm for the homogeneous set sandwich problem
- Discrete extremal problems
- Duality for semiantichains and unichain coverings in products of special posets
- On fully orientability of 2-degenerate graphs
- On the difference of the enhanced power graph and the power graph of a finite group
- A bound for the chromatic number of \((P_5, \text{gem})\)-free graphs
- On some graph classes related to perfect graphs: a survey
- The complexity of recognizing linear systems with certain integrality properties
- Line graphs of monogenic semigroup graphs
- Some indices over a new algebraic graph
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs
- scientific article; zbMATH DE number 2230322 (Why is no real title available?)
- A note on finding all homogeneous set sandwiches
- Hall's and Kőnig's theorem in graphs and hypergraphs
- Substitution and \(\chi\)-boundedness
- On edge perfectness and classes of bipartite graphs
- A weak box-perfect graph theorem
- Finite checkability for integer rounding properties in combinatorial programming problems
- A semi-strong perfect graph theorem
- The story of perfectly orderable graphs
- Combinatorial differential algebra of \(x^p\)
- Subgroup sum graphs of finite abelian groups
- A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs
- A classification of certain graphs with minimal imperfection properties
- On stable set polyhedra for K//(1,3)free graphs
- Convex-round graphs are circular-perfect
- Some properties on the disjunctive product over graphs of monogenic semigroups
- New classes of Berge perfect graphs
- Balanced matrices
- Counting List Matrix Partitions of Graphs
- 2-clique-bond of stable set polyhedra
- Gallai colorings and domination in multipartite digraphs
- Almost integral polyhedra related to certain combinatorial optimization problems
- A polyhedral approach to the stability of a family of coalitions
- The matroids with the max-flow min-cut property
- Vertex- and edge-minimal and locally minimal graphs
- Skew partitions in perfect graphs
- Attempting perfect hypergraphs
- On the sibling-structure of perfect graphs
- Polyhedral proof methods in combinatorial optimization
- Minimax relations for the partial q-colorings of a graph
- Substitution-closed pattern classes
- Motivations and history of some of my conjectures
- A new characterization of trivially perfect graphs
- Covering, Packing and Generalized Perfection
- A min-max relation for the partial q-colourings of a graph. II: Box perfection
- A notion of cross-perfect bipartite graphs
- Integer round-up property for the chromatic number of some \(h\)-perfect graphs
- On the connectivity and independence number of power graphs of groups
- Perfect graphs, kernels, and cores of cooperative games
- On the strong perfect graph conjecture and critical graphs
- The maximum vertex coverage problem on bipartite graphs
- Arithmetic aspects of symmetric edge polytopes
- Edge-colouring of regular graphs of large degree
- Complexity of list coloring problems with a fixed total number of colors
- Two double poset polytopes
- The \(k\)-dominating graph
- Matchings and covers in hypergraphs
- Skew partition sandwich problem is NP-complete
- Amalgams and \(\chi\)-boundedness
- An efficient algorithm for solving the homogeneous set sandwich problem
- Coprime divisors graphs and their coloring parameters
- An integer analogue of Carathéodory's theorem
- All minimal prime extensions of hereditary classes of graphs
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)
