Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph (Q509625): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Some large graphs with given degree and diameter / 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: 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 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: Dichotomies properties on computational complexity of \(S\)-packing coloring problems / 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: \(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 characterization of cubic graphs with paired-domination number three-fifths their order / rank
 
Normal rank
Property / cites work
 
Property / cites work: The S-packing chromatic number of a graph / 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 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: 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: Q4820787 / 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 / cites work
 
Property / cites work: Q3126445 / rank
 
Normal rank

Latest revision as of 10:29, 13 July 2024

scientific article
Language Label Description Also known as
English
Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph
scientific article

    Statements

    Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 February 2017
    0 references
    packing chromatic number
    0 references
    cubic graph
    0 references
    subdivision
    0 references
    S-coloring
    0 references
    generalized prism
    0 references
    Petersen graph
    0 references
    0 references
    0 references
    0 references

    Identifiers

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