Colouring Some Classes of Perfect Graphs Robustly (Q3439399): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4172077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3344031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Meyniel / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216686 / 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: Linear-time recognition of circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682511 / 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: Efficient graph representations / rank
 
Normal rank

Latest revision as of 20:09, 25 June 2024

scientific article
Language Label Description Also known as
English
Colouring Some Classes of Perfect Graphs Robustly
scientific article

    Statements

    Colouring Some Classes of Perfect Graphs Robustly (English)
    0 references
    0 references
    0 references
    29 May 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    perfect graph
    0 references
    graph colouring
    0 references
    meyniel graph
    0 references
    intersection graph
    0 references
    existentially polytime theorem
    0 references
    0 references