scientific article; zbMATH DE number 3168327
From MaRDI portal
Publication:3286847
Cited in
(72)- Coloring Artemis graphs
- A notion of cross-perfect bipartite graphs
- Brambles and independent packings in chordal graphs
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- On weakly diamond-free Berge graphs
- Some properties of minimal imperfect graphs
- Even pairs in claw-free perfect graphs
- On slim graphs, even pairs, and star-cutsets
- Studies on hypergraphs. I: Hyperforests
- Antitwins in partitionable graphs
- Degrees and independent sets of hypergraphs
- Matroidal graphs
- Induced matchings
- Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers
- On Tucker vertices of graphs
- The independence number of graphs in terms of degrees
- Perfect graphs with no \(P_ 5\) and no \(K_ 5\)
- Coloring perfect degenerate graphs
- Motivations and history of some of my conjectures
- Path parity and perfection
- An algorithm for coloring some perfect graphs
- Quasi-star-cutsets and some consequences
- The graph sandwich problem for 1-join composition is NP-complete
- Coloring square-free Berge graphs
- Finding balance: split graphs and related classes
- On the quasi-locally paw-free graphs
- On dart-free perfectly contractile graphs
- Discs in unbreakable graphs
- On superperfection of edge intersection graphs of paths
- On the interval chromatic number of proper interval graphs
- The story of perfectly orderable graphs
- Bounding clique-width via perfect graphs
- Matrix partitions of perfect graphs
- A class of perfectly contractile graphs
- On balanced graphs
- Complementation in T-perfect graphs
- On the dominator coloring in proper interval graphs and block graphs
- Exact and parameterized algorithms for (k,i)-coloring
- The maximum weight stable set problem in (P₆, bull)-free graphs
- Covering, Packing and Generalized Perfection
- Even pairs in square-free Berge graphs
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- Fast Skew Partition Recognition
- Transitive orientations in bull-reducible Berge graphs
- scientific article; zbMATH DE number 2230322 (Why is no real title available?)
- On the maximum weight independent set problem in graphs without induced cycles of length at least five
- Graph transformations preserving the stability number
- On coloring problems with local constraints
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
- Graph transformations preserving the stability number
- Recognition of quasi-Meyniel graphs
- Finding a shortest even hole in polynomial time
- LARGE SIGNED SUBSET SUMS
- Perfectly contractile graphs and quadratic toric rings
- Some properties of edge intersection graphs of single-bend paths on a grid
- \(k\)-domination and \(k\)-independence in graphs: A survey
- A characterization of star-perfect graphs
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths
- Integral sum graphs G n and G -r,n are perfect graphs
- On non-superperfection of edge intersection graphs of paths
- On the chromatic number of a family of odd hole free graphs
- On the structure of bull-free perfect graphs
- Counterexamples to three conjectures concerning perfect graphs
- Codegree and regularity of stable set polytopes
- Graphs of bounded chordality
- Some properties of star-perfect graphs
- Toric ideals of matching polytopes and edge colorings
- Improved algorithms for perfect graphs and odd holes
- Kempe equivalence and quadratic toric rings
- A min-max relation on dicuts and dijoins in weighted chordal digraphs
- On the structure of certain intersection graphs
- A bipartite analogue of Dilworth's theorem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3286847)
