Packing chromatic number of base-3 Sierpiński graphs (Q2631074): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-015-1647-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2247215154 / 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: The packing coloring problem for lobsters and partner limited graphs / 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: Generalized power domination: propagation radius and Sierpiński graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average eccentricity of Sierpiński graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing chromatic number of distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The packing coloring of distance graphs \(D(k,t)\) / 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: The packing chromatic number of infinite product graphs / 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: Q3565864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dichotomies properties on computational complexity of \(S\)-packing coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the packing chromatic number of subcubic outerplanar graphs / 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: New results on variants of covering codes in Sierpiński graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm to determine all shortest paths in Sierpiński graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tower of Hanoi – Myths and Maths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the packing chromatic number of the Cartesian product of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs S(n, k) and a Variant of the Tower of Hanoi Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the packing chromatic number of square and hexagonal lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global strong defensive alliances of Sierpiński-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractals and Universal Spaces in Dimension Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Paths in the Tower of Hanoi Graph and Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling the packing coloring problem of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on packing chromatic number of the square lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On packing colorings of distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The packing chromatic number of hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear \(t\)-colorings of Sierpiński-like graphs / rank
 
Normal rank

Latest revision as of 08:13, 12 July 2024

scientific article
Language Label Description Also known as
English
Packing chromatic number of base-3 Sierpiński graphs
scientific article

    Statements

    Packing chromatic number of base-3 Sierpiński graphs (English)
    0 references
    0 references
    0 references
    0 references
    28 July 2016
    0 references
    packing
    0 references
    packing chromatic number
    0 references
    Sierpiński graphs
    0 references
    0 references
    0 references

    Identifiers