Dichotomies properties on computational complexity of \(S\)-packing coloring problems (Q2407038): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Polynomial instances of the Packing Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Packing Coloring Problem for (q,q-4) Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickly excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the packing chromatic number of Cartesian products, hexagonal lattice, and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the packing coloring problem for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the packing chromatic number of some lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3070232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The S-packing chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on \(S\)-packing colorings of lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Distance Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über eine Eigenschaft der ebenen Komplexe / rank
 
Normal rank

Latest revision as of 11:11, 14 July 2024

scientific article
Language Label Description Also known as
English
Dichotomies properties on computational complexity of \(S\)-packing coloring problems
scientific article

    Statements

    Dichotomies properties on computational complexity of \(S\)-packing coloring problems (English)
    0 references
    0 references
    28 September 2017
    0 references
    NP-complete problem
    0 references
    graph
    0 references
    packing chromatic number
    0 references
    \(S\)-packing chromatic number
    0 references
    \(d\)-distance coloring
    0 references

    Identifiers

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