An infinite family of subcubic graphs with unbounded packing chromatic number (Q1637153): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2018.05.004 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962757805 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1801.09871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The packing coloring problem for lobsters and partner limited graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing chromatic number of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The packing chromatic number of the infinite square lattice is between 13 and 15 / 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 of base-3 Sierpiński graphs / 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: Packing chromatic number under local changes in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The packing coloring of distance graphs \(D(k,t)\) / 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: \(S\)-packing colorings of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3070232 / 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: Packing Coloring of Undirected and Oriented Generalized Theta Graphs / 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: On packing colorings of distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The packing chromatic number of hypercubes / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129761753 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2018.05.004 / rank
 
Normal rank

Latest revision as of 00:18, 11 December 2024

scientific article
Language Label Description Also known as
English
An infinite family of subcubic graphs with unbounded packing chromatic number
scientific article

    Statements

    An infinite family of subcubic graphs with unbounded packing chromatic number (English)
    0 references
    0 references
    0 references
    7 June 2018
    0 references
    packing
    0 references
    coloring
    0 references
    packing coloring
    0 references
    diameter
    0 references
    subcubic graph
    0 references

    Identifiers