Topics on perfect graphs
From MaRDI portal
Publication:798301
zbMATH Open0546.00006MaRDI QIDQ798301FDOQ798301
Authors:
Publication date: 1984
Published in: Annals of Discrete Mathematics (Search for Journal in Brave)
Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Conference proceedings and collections of articles (00Bxx)
Cited In (only showing first 100 items - show all)
- Reformulations and complexity of the clique interdiction problem by graph mapping
- Bull-Reducible Berge Graphs are Perfect
- On domination elimination orderings and domination graphs
- Murky graphs
- Elementary bipartite graphs and unique colourability
- Graphes parfaitement ordonnables généralisés. (Generalized perfectly orderable graphs)
- Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
- Vertex coloring \((4K_1\), hole-twin, 5-wheel)-free graphs
- ?-Perfect graphs
- A note on perfect orders
- A good characterization of cograph contractions
- Disjoint clique cutsets in graphs without long holes
- Quasi-brittle graphs, a new class of perfectly orderable graphs
- Title not available (Why is that?)
- The parity path problem on some subclasses of perfect graphs
- On some graph classes related to perfect graphs: a survey
- The story of perfectly orderable graphs
- Quasimorphisms, random walks, and transient subsets in countable groups
- A clique tree algorithm for partitioning a chordal graph into transitive subgraphs
- Short-chorded and perfect graphs
- Distances in cocomparability graphs and their powers
- Slightly triangulated graphs are perfect
- On the quasi-locally paw-free graphs
- On the \(P_ 4\)-structure of perfect graphs. IV: Partner graphs
- Perfectly contractile graphs and quadratic toric rings
- Testing superperfection of k-trees
- On minimal forbidden subgraph characterizations of balanced graphs
- On coloring a class of claw-free and hole-twin-free graphs
- New classes of perfect graphs
- Kernels and perfectness in arc-local tournament digraphs
- Preperfect graphs
- On generalized perfect graphs: Bounded degree and bounded edge perfection
- A characterization of intersection graphs of the maximal rectangles of a polyomino
- Perfect, ideal and balanced matrices
- On kernels in perfect graphs
- Even pairs in claw-free perfect graphs
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs
- 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
- 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
- Strong cliques in diamond-free graphs
- Finding large holes
- Recognizing quasi-triangulated graphs.
- NeST graphs
- Quasi-star-cutsets and some consequences
- Preference structures and threshold models
- On the closure of triangle-free graphs under substitution
- Polyominos and perfect graphs
- On the semi-perfect elimination
- Expressing combinatorial optimization problems by linear programs
- Completely separable graphs
- Nonlinear formulations and improved randomized approximation algorithms for multicut problems
- 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
- An algorithm for partial Grundy number on trees
- A coloring algorithm for \(4 K_1\)-free line graphs
- A note on odd/even cycles
- A note on even pairs
- Weak bipolarizable graphs
- A Note on k-Colorability of P 5-Free Graphs
- Optimizing weakly triangulated graphs
- Discs in unbreakable graphs
- On coloring a class of claw-free graphs.
- 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
- Characterizations of \((4 K_1,C_4,C_5)\)-free graphs
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs
- On the computational complexity of ordered subgraph recognition
- A parallel algorithm for minimum weighted colouring of triangulated graphs
- Coloring graphs with stable cutsets
- Grinstead's conjecture is true for graphs with a small clique number
- On edge perfectness and classes of bipartite graphs
- Paw-free 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
- Title not available (Why is that?)
- A Taxonomy of Perfect Domination
- Motivations and history of some of my conjectures
- Preference Structures and Co-comparability Graphs
- A tutorial on the use of graph coloring for some problems in robotics
- On circular-perfect graphs: a survey
- Perfectly contractile graphs
- Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3
- On a conjecture about uniquely colorable perfect graphs
- Treewidth and pathwidth of permutation graphs
- Bipartite-perfect graphs
- A fast parallel algorithm to recognize partitionable graphs
- Compositions for perfect graphs
- A polynomial algorithm for the parity path problem on perfectly orientable graphs
- Some properties of minimal imperfect graphs
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)
