On the packing chromatic number of Cartesian products, hexagonal lattice, and trees (Q5920353): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the independence graph of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributive online channel assignment for hexagonal cellular networks with constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3070232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4374717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect r-domination in the Kronecker product of three cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A technique for multicoloring triangle-free hexagonal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936660 / rank
 
Normal rank

Latest revision as of 12:05, 27 June 2024

scientific article; zbMATH DE number 5206101
Language Label Description Also known as
English
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
scientific article; zbMATH DE number 5206101

    Statements

    On the packing chromatic number of Cartesian products, hexagonal lattice, and trees (English)
    0 references
    0 references
    0 references
    0 references
    29 October 2007
    0 references
    0 references
    Packing chromatic number
    0 references
    Cartesian product of graphs
    0 references
    hexagonal lattice
    0 references
    subdivision graph
    0 references
    tree
    0 references
    computational complexity
    0 references
    0 references