Coloring perfect graphs with no balanced skew-partitions (Q490982): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q57949599 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2952375877 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1308.6444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden Induced Subgraphs of Double-split Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting 2-joins faster / rank
 
Normal rank
Property / cites work
 
Property / cites work: Berge trigraphs / 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: An algorithm for finding homogeneous pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Some H-Join Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The splittance of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / 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: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3621680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing Berge graphs and detecting balanced skew partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization with 2-joins / rank
 
Normal rank

Revision as of 16:00, 10 July 2024

scientific article
Language Label Description Also known as
English
Coloring perfect graphs with no balanced skew-partitions
scientific article

    Statements

    Coloring perfect graphs with no balanced skew-partitions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 August 2015
    0 references
    perfect graphs
    0 references
    Berge graphs
    0 references
    maximum stable set
    0 references
    2-join
    0 references
    skew partition
    0 references
    homogeneous pair
    0 references

    Identifiers