A note on the complexity of longest path problems related to graph coloring (Q1433224): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Athanasios Migdalas / rank
Normal rank
 
Property / author
 
Property / author: Athanasios Migdalas / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GRAFFITI / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4245749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4719750 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0893-9659(04)90003-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1975581618 / rank
 
Normal rank

Latest revision as of 11:08, 30 July 2024

scientific article
Language Label Description Also known as
English
A note on the complexity of longest path problems related to graph coloring
scientific article

    Statements

    A note on the complexity of longest path problems related to graph coloring (English)
    0 references
    0 references
    0 references
    15 June 2004
    0 references
    Longest path
    0 references
    Graph coloring
    0 references
    Complexity
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references