On the packing chromatic number of subcubic outerplanar graphs (Q1727741): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2018.07.034 / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 1703.05023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing chromatic number of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infinite family of subcubic graphs with unbounded packing chromatic number / 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: 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: \(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: On the packing chromatic number of square and hexagonal lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((d, n)\)-packing colorings of infinite lattices / 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: A note on packing chromatic number of the square lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On packing colorings of distance graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129226746 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2018.07.034 / rank
 
Normal rank

Latest revision as of 06:07, 11 December 2024

scientific article
Language Label Description Also known as
English
On the packing chromatic number of subcubic outerplanar graphs
scientific article

    Statements

    On the packing chromatic number of subcubic outerplanar graphs (English)
    0 references
    0 references
    0 references
    0 references
    20 February 2019
    0 references
    packing colouring
    0 references
    packing chromatic number
    0 references
    outerplanar graphs
    0 references
    subcubic graphs
    0 references

    Identifiers