The packing chromatic number of infinite product graphs (Q1024309): 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: 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: Q4523707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820787 / rank
 
Normal rank

Revision as of 15:44, 1 July 2024

scientific article
Language Label Description Also known as
English
The packing chromatic number of infinite product graphs
scientific article

    Statements

    Identifiers