Topics on perfect graphs
From MaRDI portal
The articles of this volume will be reviewed individually under the abbreviation Perfect graphs, Ann. Discrete Math. 21.
Cited in
(only showing first 100 items - show all)- Decomposition of perfect graphs
- On randomized stopping points and perfect graphs
- New classes of perfect graphs
- Alternating orientation and alternating colouration of perfect graphs
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs
- Murky graphs
- Paw-free graphs
- Two classes of perfect graphs
- Weak bipolarizable graphs
- Opposition graphs are strict quasi-parity graphs
- A note on odd/even cycles
- Parity graphs are kernel-M-solvable
- A note on perfect orders
- Gallai graphs and anti-Gallai graphs
- Some properties of minimal imperfect graphs
- Even pairs in claw-free perfect graphs
- Coloring graphs with stable cutsets
- Short-chorded and perfect graphs
- On the complexity of testing for odd holes and induced odd paths
- Graphes parfaitement ordonnables généralisés. (Generalized perfectly orderable graphs)
- Finding large holes
- Distances in cocomparability graphs and their powers
- Expressing combinatorial optimization problems by linear programs
- A charming class of perfectly orderable graphs
- A parallel algorithm for minimum weighted colouring of triangulated graphs
- Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets
- Antitwins in partitionable graphs
- The forbidden subgraph characterization of directed vertex graphs
- Polyominos and perfect graphs
- New classes of Berge perfect graphs
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
- Slightly triangulated graphs are perfect
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
- Coloring perfect degenerate graphs
- Motivations and history of some of my conjectures
- Chair-free Berge graphs are perfect
- On a conjecture about uniquely colorable perfect graphs
- Recognizing quasi-triangulated graphs.
- Quasi-star-cutsets and some consequences
- Elementary bipartite graphs and unique colourability
- NeST graphs
- A coloring algorithm for \(4 K_1\)-free line graphs
- On the structure of (even hole, kite)-free graphs
- The P versus NP-complete dichotomy of some challenging problems in graph theory
- Quasimorphisms, random walks, and transient subsets in countable groups
- On the quasi-locally paw-free graphs
- Bipartite-perfect graphs
- On the \(P_ 4\)-structure of perfect graphs. IV: Partner graphs
- Optimizing weakly triangulated graphs
- Odd cycles and matrices with integrality properties
- On the semi-perfect elimination
- A clique tree algorithm for partitioning a chordal graph into transitive subgraphs
- Discs in unbreakable graphs
- On powers of m-trapezoid graphs
- On edge perfectness and classes of bipartite graphs
- A polynomial algorithm for the parity path problem on perfectly orientable graphs
- The parity path problem on some subclasses of perfect graphs
- On coloring a class of claw-free and hole-twin-free graphs
- Vertex coloring \((4K_1\), hole-twin, 5-wheel)-free graphs
- On coloring a class of claw-free graphs.
- On the structure of graphs without claw, \(4K_1\) and co-R
- 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
- Compositions for perfect graphs
- The intersection of two vertex coloring problems
- Quasi-brittle graphs, a new class of perfectly orderable graphs
- The story of perfectly orderable graphs
- Characterizations of \((4 K_1,C_4,C_5)\)-free graphs
- Kernels and perfectness in arc-local tournament digraphs
- Grinstead's conjecture is true for graphs with a small clique number
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs
- An algorithm for partial Grundy number on trees
- scientific article; zbMATH DE number 3869356 (Why is no real title available?)
- Bull-Reducible Berge Graphs are Perfect
- A New Class of Brittle Graphs
- A Note on k-Colorability of P 5-Free Graphs
- On box totally dual integral polyhedra
- Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3
- ?-Perfect graphs
- A good characterization of cograph contractions
- Analysis of LP relaxations for multiway and multicut problems
- Treewidth and pathwidth of permutation graphs
- Disjoint clique cutsets in graphs without long holes
- The perfection and recognition of bull-reducible Berge graphs
- Coloration de graphes : fondements et applications
- On the computational complexity of ordered subgraph recognition
- Preference structures and threshold models
- Preference Structures and Co-comparability Graphs
- On the perfect orderability of unions of two graphs
- Testing superperfection of k-trees
- A Taxonomy of Perfect Domination
- Nonlinear formulations and improved randomized approximation algorithms for multicut problems
- scientific article; zbMATH DE number 2230322 (Why is no real title available?)
- A note on even pairs
- Strong cliques in diamond-free graphs
- On minimal forbidden subgraph characterizations of balanced graphs
- Perfect, ideal and balanced matrices
- Research problems
- Perfectly contractile graphs and quadratic toric rings
This page was built for publication: Topics on perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798301)
