\(S\)-packing colorings of cubic graphs (Q294536): 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: Q3115254 / 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: List-coloring the square of a subcubic graph / 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: Q3070232 / 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: Choosability of the square of planar subcubic graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on the distance-colouring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on packing chromatic number of the square lattice / rank
 
Normal rank

Latest revision as of 03:46, 12 July 2024

scientific article
Language Label Description Also known as
English
\(S\)-packing colorings of cubic graphs
scientific article

    Statements

    Identifiers