Graphs that are critical for the packing chromatic number (Q2118245): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.7151/dmgt.2298 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3004129935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing chromatic number of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing chromatic number of subdivisions of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing coloring of Sierpiński-type graphs / 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: Packing chromatic number under local changes in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing chromatic number versus chromatic and clique number / 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 subcubic outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3070232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on complexity of packing coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing chromatic vertex-critical graphs / 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: Packing coloring of generalized Sierpinski 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: Packing colouring of some classes of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing coloring of some undirected and oriented coronae 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

Latest revision as of 10:49, 28 July 2024

scientific article
Language Label Description Also known as
English
Graphs that are critical for the packing chromatic number
scientific article

    Statements

    Graphs that are critical for the packing chromatic number (English)
    0 references
    0 references
    0 references
    22 March 2022
    0 references
    packing coloring
    0 references
    critical graph
    0 references
    diameter
    0 references
    block graph
    0 references
    tree
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references