A lower bound for the packing chromatic number of the Cartesian product of cycles (Q1955603): 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: Q3065457 / 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: A note on packing chromatic number of the square lattice / rank
 
Normal rank

Latest revision as of 13:39, 6 July 2024

scientific article
Language Label Description Also known as
English
A lower bound for the packing chromatic number of the Cartesian product of cycles
scientific article

    Statements

    A lower bound for the packing chromatic number of the Cartesian product of cycles (English)
    0 references
    0 references
    0 references
    0 references
    14 June 2013
    0 references
    0 references
    packing
    0 references
    chromatic
    0 references
    Cartesian product
    0 references
    cycles
    0 references
    bounds
    0 references
    0 references