2K2 vertex-set partition into nonempty parts (Q3503567): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5501285 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2K2-Partition Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding<i>H</i>-partitions efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms to reflexive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix partitions of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: List matrix partitions of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4521527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree representation for \(P_ 4\)-sparse graphs / rank
 
Normal rank

Latest revision as of 11:23, 28 June 2024

scientific article
Language Label Description Also known as
English
2K2 vertex-set partition into nonempty parts
scientific article

    Statements

    2K2 vertex-set partition into nonempty parts (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 June 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    structural graph theory
    0 references
    computational difficulty of problems
    0 references
    analysis of algorithms
    0 references
    problem complexity
    0 references
    0 references