Partitions of graphs into one or two independent sets and cliques (Q1917483): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q126550364, #quickstatements; #temporary_batch_1719314627150
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Processor Scheduling with Start-Times and Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The splittance of a graph / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126550364 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:26, 25 June 2024

scientific article
Language Label Description Also known as
English
Partitions of graphs into one or two independent sets and cliques
scientific article

    Statements

    Partitions of graphs into one or two independent sets and cliques (English)
    0 references
    12 December 1996
    0 references
    partitions of graphs
    0 references
    polynomial time recognition
    0 references
    split graphs
    0 references

    Identifiers