Polynomial graph-colorings (Q5096147): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Colouring by Semicomplete Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3758852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings and interpretations: a connection between graphs and grammar forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the general coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912037 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bfb0028977 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1539999544 / rank
 
Normal rank

Latest revision as of 10:43, 30 July 2024

scientific article; zbMATH DE number 7571920
Language Label Description Also known as
English
Polynomial graph-colorings
scientific article; zbMATH DE number 7571920

    Statements

    Identifiers

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