Topics on perfect graphs

No author found.

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)

Related Items

A Taxonomy of Perfect Domination, Nonlinear formulations and improved randomized approximation algorithms for multicut problems, Perfectly contractile graphs and quadratic toric rings, On domination elimination orderings and domination graphs, A note on even pairs, Perfect, ideal and balanced matrices, Research problems, Strong cliques in diamond-free graphs, On minimal forbidden subgraph characterizations of balanced graphs, Unnamed Item, Elementary bipartite graphs and unique colourability, NeST graphs, Vertex coloring \((4K_1\), hole-twin, 5-wheel)-free graphs, New classes of Berge perfect graphs, Quasi-brittle graphs, a new class of perfectly orderable graphs, On randomized stopping points and perfect graphs, On coloring a class of claw-free graphs., New classes of perfect graphs, Efficient algorithms for minimum weighted colouring of some classes of perfect graphs, Slightly triangulated graphs are perfect, Alternating orientation and alternating colouration of perfect graphs, The story of perfectly orderable graphs, Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance, On box totally dual integral polyhedra, Testing superperfection of k-trees, A reduction procedure for coloring perfect \(K_ 4\)-free graphs, A clique tree algorithm for partitioning a chordal graph into transitive subgraphs, Coloration de graphes : fondements et applications, Murky graphs, Coloring perfect degenerate graphs, Motivations and history of some of my conjectures, Discs in unbreakable graphs, On powers of \(m\)-trapezoid graphs, Paw-free graphs, On the structure of graphs without claw, \(4K_1\) and co-R, On a conjecture of Hoàng and Tu concerning perfectly orderable graphs, Two classes of perfect graphs, On edge perfectness and classes of bipartite graphs, Weak bipolarizable graphs, ?-Perfect graphs, Opposition graphs are strict quasi-parity graphs, A New Class of Brittle Graphs, A polynomial algorithm for the parity path problem on perfectly orientable graphs, Chair-free Berge graphs are perfect, Characterizations of \((4 K_1,C_4,C_5)\)-free graphs, A note on odd/even cycles, On a conjecture about uniquely colorable perfect graphs, Parity graphs are kernel-M-solvable, A note on perfect orders, On the perfect orderability of unions of two graphs, Gallai graphs and anti-Gallai graphs, Some properties of minimal imperfect graphs, The parity path problem on some subclasses of perfect graphs, Even pairs in claw-free perfect graphs, Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3, On some graph classes related to perfect graphs: a survey, A coloring algorithm for \(4 K_1\)-free line graphs, On the computational complexity of ordered subgraph recognition, Preference structures and threshold models, Kernels and perfectness in arc-local tournament digraphs, Grinstead's conjecture is true for graphs with a small clique number, Completely separable graphs, On the closure of triangle-free graphs under substitution, A fast parallel algorithm to recognize partitionable graphs, Coloring graphs with stable cutsets, Recognizing quasi-triangulated graphs., 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), On circular-perfect graphs: a survey, Treewidth and pathwidth of permutation graphs, Finding large holes, Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number, Distances in cocomparability graphs and their powers, Expressing combinatorial optimization problems by linear programs, A tutorial on the use of graph coloring for some problems in robotics, 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, Preperfect graphs, On kernels in perfect graphs, On generalized perfect graphs: Bounded degree and bounded edge perfection, A characterization of intersection graphs of the maximal rectangles of a polyomino, 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, Antitwins in partitionable graphs, Compositions for perfect graphs, Disjoint clique cutsets in graphs without long holes, A good characterization of cograph contractions, The perfection and recognition of bull-reducible Berge graphs, A Note on k-Colorability of P 5-Free Graphs, Analysis of LP relaxations for multiway and multicut problems, On the quasi-locally paw-free graphs, Bipartite-perfect graphs, The intersection of two vertex coloring problems, 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, The forbidden subgraph characterization of directed vertex graphs, On coloring a class of claw-free and hole-twin-free graphs, A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs, An algorithm for partial Grundy number on trees, Perfectly contractile graphs, Bull-Reducible Berge Graphs are Perfect, Quasi-star-cutsets and some consequences, Preference Structures and Co-comparability Graphs, Decomposition of perfect graphs, Polyominos and perfect graphs