The packing chromatic number of the infinite square lattice is between 13 and 15 (Q528575): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2590872906 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1510.02374 / 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: Satisfiability and computing van der Waerden numbers / 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: Subdivision into i-packings and S-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 \(S\)-packing colorings of lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new method to construct lower bounds for van der Waerden numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the packing chromatic number of the Cartesian product of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SAT Attack on the Erdős Discrepancy Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bridging constraint satisfaction and Boolean satisfiability / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:01, 13 July 2024

scientific article
Language Label Description Also known as
English
The packing chromatic number of the infinite square lattice is between 13 and 15
scientific article

    Statements

    The packing chromatic number of the infinite square lattice is between 13 and 15 (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 May 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    packing chromatic number
    0 references
    broadcast chromatic number
    0 references
    graph colouring
    0 references
    SAT solving
    0 references
    0 references
    0 references