Cited in
(only showing first 100 items - show all)- The perfection and recognition of bull-reducible Berge graphs
- On the complexity of testing for odd holes and induced odd paths
- Analysis of LP relaxations for multiway and multicut problems
- On powers of m-trapezoid graphs
- Antitwins in partitionable graphs
- Alternating orientation and alternating colouration of perfect graphs
- On randomized stopping points and perfect graphs
- A New Class of Brittle Graphs
- On coloring a class of claw-free and hole-twin-free graphs
- On box totally dual integral polyhedra
- Research problems
- Coloration de graphes : fondements et applications
- New classes of perfect graphs
- Reformulations and complexity of the clique interdiction problem by graph mapping
- Bull-Reducible Berge Graphs are Perfect
- Preperfect graphs
- On generalized perfect graphs: Bounded degree and bounded edge perfection
- A characterization of intersection graphs of the maximal rectangles of a polyomino
- Kernels and perfectness in arc-local tournament digraphs
- On kernels in perfect graphs
- Even pairs in claw-free perfect graphs
- On domination elimination orderings and domination graphs
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs
- Murky graphs
- Perfect, ideal and balanced matrices
- On the perfect orderability of unions of two graphs
- Coloring perfect degenerate graphs
- Opposition graphs are strict quasi-parity graphs
- Parity graphs are kernel-M-solvable
- Elementary bipartite graphs and unique colourability
- Decomposition of perfect graphs
- Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets
- On the structure of (even hole, kite)-free graphs
- Finding large holes
- Recognizing quasi-triangulated graphs.
- NeST graphs
- Graphes parfaitement ordonnables généralisés. (Generalized perfectly orderable graphs)
- Strong cliques in diamond-free graphs
- Vertex coloring \((4K_1\), hole-twin, 5-wheel)-free graphs
- On the closure of triangle-free graphs under substitution
- Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
- Quasi-star-cutsets and some consequences
- Polyominos and perfect graphs
- Expressing combinatorial optimization problems by linear programs
- Preference structures and threshold models
- On the semi-perfect elimination
- A note on perfect orders
- ?-Perfect graphs
- Completely separable graphs
- Odd cycles and matrices with integrality properties
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
- The P versus NP-complete dichotomy of some challenging problems in graph theory
- Two classes of perfect graphs
- Nonlinear formulations and improved randomized approximation algorithms for multicut problems
- An algorithm for partial Grundy number on trees
- A coloring algorithm for \(4 K_1\)-free line graphs
- A note on odd/even cycles
- Weak bipolarizable graphs
- Optimizing weakly triangulated graphs
- Discs in unbreakable graphs
- A note on even pairs
- On coloring a class of claw-free graphs.
- A Note on k-Colorability of P 5-Free Graphs
- A good characterization of cograph contractions
- Quasi-brittle graphs, a new class of perfectly orderable graphs
- Disjoint clique cutsets in graphs without long holes
- The intersection of two vertex coloring problems
- Chair-free Berge graphs are perfect
- On a conjecture of Hoàng and Tu concerning perfectly orderable graphs
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
- Characterizations of \((4 K_1,C_4,C_5)\)-free graphs
- The parity path problem on some subclasses of perfect graphs
- On some graph classes related to perfect graphs: a survey
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs
- A parallel algorithm for minimum weighted colouring of triangulated graphs
- Coloring graphs with stable cutsets
- scientific article; zbMATH DE number 2230322 (Why is no real title available?)
- On the computational complexity of ordered subgraph recognition
- Grinstead's conjecture is true for graphs with a small clique number
- On edge perfectness and classes of bipartite graphs
- Paw-free graphs
- The story of perfectly orderable graphs
- A charming class of perfectly orderable graphs
- The forbidden subgraph characterization of directed vertex graphs
- New classes of Berge perfect graphs
- Gallai graphs and anti-Gallai graphs
- scientific article; zbMATH DE number 3869356 (Why is no real title available?)
- Quasimorphisms, random walks, and transient subsets in countable groups
- Motivations and history of some of my conjectures
- A Taxonomy of Perfect Domination
- A tutorial on the use of graph coloring for some problems in robotics
- A clique tree algorithm for partitioning a chordal graph into transitive subgraphs
- Preference Structures and Co-comparability Graphs
- Perfectly contractile graphs
- On circular-perfect graphs: a survey
- Short-chorded and perfect graphs
- Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3
- On a conjecture about uniquely colorable perfect graphs
- Distances in cocomparability graphs and their powers
- Slightly triangulated graphs are perfect
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)
