scientific article; zbMATH DE number 1455118
The articles of this volume will be reviewed individually. Indexed articles: \textit{Berge, C.; Ramírez Alfonsín, J. L.}, Origins and genesis, 1-12 [Zbl 0984.05040] \textit{Reed, Bruce A.}, From conjecture to theorem, 13-24 [Zbl 0983.05045] \textit{Maffray, Frédéric; Preissmann, Myriam}, A translation of Gallai's paper: `Transitiv orientierbare Graphen', 25-66 [Zbl 0989.05050] \textit{Everett, Hazel; de Figueiredo, Celina M. H.; Linhares Sales, Cláudia; Maffray, Frédéric; Porto, Oscar; Reed, Bruce A.}, Even pairs, 67-92 [Zbl 0990.05053] \textit{Hougardy, Stefan}, The \(P_4\)-structure of perfect graphs, 93-112 [Zbl 0990.05056] \textit{Hayward, Ryan; Reed, Bruce A.}, Forbidding holes and antiholes, 113-137 [Zbl 0983.05044] \textit{Hoàng, Chính T.}, Perfectly orderable graphs: A survey, 139-166 [Zbl 0993.05079] \textit{Rusu, Irena}, Cutsets in perfect and minimal imperfect graphs, 167-183 [Zbl 0984.05039] \textit{Preissmann, Myriam; Sebő, András}, Some aspects of minimal imperfect graphs, 185-214 [Zbl 0990.05055] \textit{McDiarmid, Colin}, Graph imperfection and channel assignment, 215-231 [Zbl 0990.05051] \textit{Reed, Bruce A.}, A gentle introduction to semi-definite programming, 233-259 [Zbl 1076.90529] \textit{Shepherd, F. B.}, The theta body and imperfection, 261-291 [Zbl 1076.05511] \textit{Simonyi, Gábor}, Perfect graphs and graph entropy: An updated survey, 293-328 [Zbl 0990.05054] \textit{Chvátal, Vašek}, A bibliography on perfect graphs, 329-358 [Zbl 0999.05500]
- Triangle-free strongly circular-perfect graphs
- Cliques, holes and the vertex coloring polytope
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- Two classes of perfect graphs
- An approach to solving \(A^{k}=J-I\)
- Square-free perfect graphs.
- A note on chromatic number of (cap, even hole)-free graphs
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- The P versus NP-complete dichotomy of some challenging problems in graph theory
- Polyhedral results on the stable set problem in graphs containing even or odd pairs
- Linear extensions and comparable pairs in partial orders
- Bichromatic \(P_{4}\)-composition schemes for perfect orderability
- Corrigendum to: ``Bisimplicial vertices in even-hole-free graphs
- Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs
- On some graph classes related to perfect graphs: a survey
- On circular-perfect graphs: a survey
- Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
- Gallai-Ramsey numbers for books
- Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case
- Line-graphs of cubic graphs are normal
- Kernels and perfectness in arc-local tournament digraphs
- On classes of minimal circular-imperfect graphs
- Skew partitions in perfect graphs
- Computing the clique number of \(a\)-perfect graphs in polynomial time
- A generalization of the theorem of Lekkerkerker and Boland
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs
- A class of perfectly contractile graphs
- Vizing bound for the chromatic number on some graph classes
- Distinct degrees and homogeneous sets
- Largest eigenvalue of the Laplacian matrix: its eigenspace and transitive orientations
- Clique and chromatic number of circular-perfect graphs
- Excluding induced subdivisions of the bull and related graphs
- Exploring the concept of perfection in 3-hypergraphs
- scientific article; zbMATH DE number 444736 (Why is no real title available?)
- Vertex decomposable graphs and obstructions to shellability
- Even pairs in square-free Berge graphs
- scientific article; zbMATH DE number 3851153 (Why is no real title available?)
- scientific article; zbMATH DE number 3869356 (Why is no real title available?)
- On strongly circular-perfectness
- Complete graphs in the Rubáiyát
- A Note on k-Colorability of P 5-Free Graphs
- scientific article; zbMATH DE number 3941576 (Why is no real title available?)
- Computing clique and chromatic number of circular-perfect graphs in polynomial time
- Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3
- Coloring vertices of a graph or finding a Meyniel obstruction
- A new characterization of perfect graphs
- Substitution and \(\chi\)-boundedness
- Random perfect graphs
- Disjoint clique cutsets in graphs without long holes
- The perfection and recognition of bull-reducible Berge graphs
- A tutorial on branch and cut algorithms for the maximum stable set problem
- Finding independent transversals efficiently
- Wing-triangulated graphs are perfect
- Fast Skew Partition Recognition
- CFI Construction and Balanced Graphs
- On Roussel-Rubio-type lemmas and their consequences
- Easily testable graph properties
- From monomials to words to graphs.
- Even-hole-free graphs still have bisimplicial vertices
- Induced regular perfect graphs
- Preperfect graphs
- Arc-consistency with linear programming reduced costs (applied to stable set in chordal graphs)
- -boundedness and related problems on graphs without long induced paths: a survey
- On the structure of (dart, odd hole)-free graphs
- Satgraphs and independent domination. I
- The maximum edit distance from hereditary graph properties
- Bisimplicial vertices in even-hole-free graphs
- On cover-structure graphs
- Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph
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)
