Coloring planar perfect graphs by decomposition (Q1093649): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Q593736 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Colin J. H. McDiarmid / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: The Strong Perfect Graph Conjecture for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(N2) algorithm for coloring perfect planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5661516 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02579263 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2065732258 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:12, 30 July 2024

scientific article
Language Label Description Also known as
English
Coloring planar perfect graphs by decomposition
scientific article

    Statements

    Coloring planar perfect graphs by decomposition (English)
    0 references
    0 references
    1986
    0 references
    This paper describes a decomposition scheme for colouring perfect graphs, so that it suffices to colour perfect graphs which are well connected. This approach yields a new good colouring algorithm for perfect planar graphs, and it seems that the approach goes further.
    0 references
    decomposition scheme
    0 references
    colouring perfect graphs
    0 references
    colouring algorithm
    0 references
    perfect planar graphs
    0 references

    Identifiers