Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete (Q1146685): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q55899212 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:52, 13 June 2024

scientific article
Language Label Description Also known as
English
Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
scientific article

    Statements

    Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete (English)
    0 references
    0 references
    1980
    0 references
    unique colorability
    0 references
    NP-complete
    0 references
    4-regular graph
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers