scientific article; zbMATH DE number 1455118
From MaRDI portal
Publication:4484907
Cited in
(66)- CFI Construction and Balanced Graphs
- Excluding induced subdivisions of the bull and related graphs
- scientific article; zbMATH DE number 444736 (Why is no real title available?)
- Complete graphs in the Rubáiyát
- On strongly circular-perfectness
- Induced regular perfect graphs
- scientific article; zbMATH DE number 3941576 (Why is no real title available?)
- Largest eigenvalue of the Laplacian matrix: its eigenspace and transitive orientations
- Wing-triangulated graphs are perfect
- Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
- Polyhedral results on the stable set problem in graphs containing even or odd pairs
- On some graph classes related to perfect graphs: a survey
- Computing the clique number of \(a\)-perfect graphs in polynomial time
- Fast Skew Partition Recognition
- Distinct degrees and homogeneous sets
- The P versus NP-complete dichotomy of some challenging problems in graph theory
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs
- Square-free perfect graphs.
- scientific article; zbMATH DE number 3869356 (Why is no real title available?)
- The maximum edit distance from hereditary graph properties
- Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs
- A new characterization of perfect graphs
- Linear extensions and comparable pairs in partial orders
- Kernels and perfectness in arc-local tournament digraphs
- An approach to solving \(A^{k}=J-I\)
- A tutorial on branch and cut algorithms for the maximum stable set problem
- Coloring vertices of a graph or finding a Meyniel obstruction
- A generalization of the theorem of Lekkerkerker and Boland
- Even-hole-free graphs still have bisimplicial vertices
- Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case
- Two classes of perfect graphs
- scientific article; zbMATH DE number 3851153 (Why is no real title available?)
- Satgraphs and independent domination. I
- Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph
- Gallai-Ramsey numbers for books
- Computing clique and chromatic number of circular-perfect graphs in polynomial time
- On classes of minimal circular-imperfect graphs
- Preperfect graphs
- The perfection and recognition of bull-reducible Berge graphs
- Disjoint clique cutsets in graphs without long holes
- Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3
- Skew partitions in perfect graphs
- Corrigendum to: ``Bisimplicial vertices in even-hole-free graphs
- Random perfect graphs
- Bichromatic \(P_{4}\)-composition schemes for perfect orderability
- On cover-structure graphs
- Cliques, holes and the vertex coloring polytope
- A note on chromatic number of (cap, even hole)-free graphs
- Easily testable graph properties
- Even pairs in square-free Berge graphs
- A Note on k-Colorability of P 5-Free Graphs
- Vertex decomposable graphs and obstructions to shellability
- A class of perfectly contractile graphs
- Finding independent transversals efficiently
- On Roussel-Rubio-type lemmas and their consequences
- Triangle-free strongly circular-perfect graphs
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- Vizing bound for the chromatic number on some graph classes
- Exploring the concept of perfection in 3-hypergraphs
- Bisimplicial vertices in even-hole-free graphs
- From monomials to words to graphs.
- Clique and chromatic number of circular-perfect graphs
- On circular-perfect graphs: a survey
- Substitution and \(\chi\)-boundedness
- Line-graphs of cubic graphs are normal
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 Q4484907)
