\(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\) (Q2028095): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2021.04.001 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W3155130972 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2005.10491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism of circulant graphs and digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing chromatic number of subdivisions of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-distance colorings of integer distance 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: Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph / 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: 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: 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: Subdivision into i-packings and S-packing chromatic number of some lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(S\)-packing colorings of cubic 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: A note on \(S\)-packing colorings of lattices / 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: A survey on the distance-colouring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect colorings of the infinite circulant graph with distances 1 and 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The packing chromatic number of the infinite square lattice is between 13 and 15 / 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 / DOI
 
Property / DOI: 10.1016/J.DAM.2021.04.001 / rank
 
Normal rank

Latest revision as of 19:50, 16 December 2024

scientific article
Language Label Description Also known as
English
\(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\)
scientific article

    Statements

    \(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\) (English)
    0 references
    0 references
    0 references
    0 references
    31 May 2021
    0 references
    \(S\)-packing coloring
    0 references
    \(S\)-packing chromatic number
    0 references
    distance graph
    0 references
    distance coloring
    0 references
    0 references

    Identifiers