scientific article; zbMATH DE number 2104737
From MaRDI portal
Publication:4820787
zbMath1058.05026MaRDI QIDQ4820787
Publication date: 1 October 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (28)
Packing coloring of some undirected and oriented coronae graphs ⋮ Packing coloring of Sierpiński-type graphs ⋮ A new approach on locally checkable problems ⋮ Notes on complexity of packing coloring ⋮ A note on \(S\)-packing colorings of lattices ⋮ Complexity of the Packing Coloring Problem for Trees ⋮ Packing chromatic number of certain fan and wheel related graphs ⋮ Packing chromatic number of cubic graphs ⋮ Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs ⋮ Packing chromatic number of distance graphs ⋮ A survey on packing colorings ⋮ \(S\)-packing coloring of cubic Halin graphs ⋮ On packing \(S\)-colorings of subcubic graphs ⋮ Packing colorings of subcubic outerplanar graphs ⋮ About \(S\)-packing coloring of subcubic graphs ⋮ The packing coloring problem for lobsters and partner limited graphs ⋮ Facial packing vertex-coloring of subdivided plane graphs ⋮ Packing chromatic number of subdivisions of cubic graphs ⋮ Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph ⋮ Packing chromatic number under local changes in a graph ⋮ Complexity of the packing coloring problem for trees ⋮ On the packing chromatic number of some lattices ⋮ On the packing chromatic number of Cartesian products, hexagonal lattice, and trees ⋮ Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs ⋮ On the packing chromatic number of Cartesian products, hexagonal lattice, and trees ⋮ Packing colouring of some classes of cubic graphs ⋮ The packing chromatic number of infinite product graphs ⋮ Polynomial instances of the Packing Coloring Problem
This page was built for publication:
