A note on \(S\)-packing colorings of lattices (Q2636817): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Acyclic and \(k\)-distance coloring of the grid / 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: 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: Distance Coloring of the Hexagonal Lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural exactly covering systems of congruences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820787 / 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

Latest revision as of 09:19, 7 July 2024

scientific article
Language Label Description Also known as
English
A note on \(S\)-packing colorings of lattices
scientific article

    Statements