Classes of perfect graphs (Q2433714): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2006.05.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2028360319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring perfect degenerate graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithm for finding the largest independent sets in graphs without forks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets of maximum weight in (\(p,q\))-colorable graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5603089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2758330 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfectly contractile graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Sets in Asteroidal Triple-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph conjecture holds for diamonded odd cycle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star-cutsets and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Dart-Free Perfect Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bull-free Berge graphs are perfect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing claw-free perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the extension of bipartite to parity graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-coloring bipartite multigraphs in \(O(E \log D)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Square-free perfect graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asteroidal Triple-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing Bull-Free Perfect Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially Ordered Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5341588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on clique separable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3836509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Comparability Graphs and of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trivially perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph conjecture for toroidal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3271426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preperfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The splittance of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly triangulated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Murky graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(P_ 4\)-structure of perfect graphs. IV: Partner graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slim graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slender graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Skeletal graphs - a new class of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for coloring Meyniel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating orientation and alternating colouration of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(P_ 4\)-structure of perfect graphs. V: Overlap graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On brittle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(P_4\)-transversals of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Perfect 2-Split Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding houses and holes in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How To Color Claw-Free Perfect Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precoloring Extension III: Classes of Perfect Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the semi-perfect elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>P</i><sub>4</sub>-Reducible Graphs-Class of Uniquely Tree-Representable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Class of Brittle Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing $P_4 $-Sparse Graphs in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4238044 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation of a finite graph by a set of intervals on the real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect graphs with no \(P_ 5\) and no \(K_ 5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split-neighbourhood graphs and the strong perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A description of claw-free perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slightly triangulated graphs are perfect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4129482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new property of critical imperfect graphs and some consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of recognizing perfectly orderable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: All variations on perfectly orderable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The validity of the strong perfect-graph conjecture for \((K_4-e)\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing bull-free perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm to color \(i\)-triangulated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: HOLES AND DOMINOES IN MEYNIEL GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing \(i\)-triangulated graphs in \(O(mn)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^2)\) algorithm to color Meyniel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5659563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chair-free Berge graphs are perfect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of the class of n-colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4024059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for weakly triangulated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for colouring perfect planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two classes of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition by clique separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Strong Perfect Graph Conjecture for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring perfect \((K_ 4\)-e)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686753 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:25, 24 June 2024

scientific article
Language Label Description Also known as
English
Classes of perfect graphs
scientific article

    Statements

    Classes of perfect graphs (English)
    0 references
    0 references
    30 October 2006
    0 references
    0 references
    survey
    0 references
    graph classes
    0 references
    algorithmic properties
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references