Achromatic number is NP-complete for cographs and interval graphs (Q1825646): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2160875590 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56390758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3812222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination in interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge inducibility of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for interval graphs and circular-arc graphs / 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: Finding Hamiltonian circuits in interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination in interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the minimum bandwidth of an interval graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686754 / rank
 
Normal rank

Latest revision as of 10:19, 20 June 2024

scientific article
Language Label Description Also known as
English
Achromatic number is NP-complete for cographs and interval graphs
scientific article

    Statements

    Achromatic number is NP-complete for cographs and interval graphs (English)
    0 references
    1989
    0 references
    cographs
    0 references
    interval graphs
    0 references
    NP-complete
    0 references
    0 references

    Identifiers