scientific article; zbMATH DE number 2104737
From MaRDI portal
Publication:4820787
zbMATH Open1058.05026MaRDI QIDQ4820787FDOQ4820787
Authors: Christian Sloper
Publication date: 1 October 2004
Title of this publication is not available (Why is that?)
Recommendations
Cited In (33)
- Facial packing vertex-coloring of subdivided plane graphs
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
- Packing colouring of some classes of cubic graphs
- Notes on complexity of packing coloring
- A new approach on locally checkable problems
- The packing coloring problem for lobsters and partner limited graphs
- A survey on packing colorings
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
- Packing chromatic number of distance graphs
- Complexity of the packing coloring problem for trees
- On packing \(S\)-colorings of subcubic graphs
- On the packing chromatic number of some lattices
- The packing chromatic number of infinite product graphs
- Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs
- Polynomial instances of the packing coloring problem
- Packing coloring of hypercubes with extended Hamming codes
- Packing coloring of Sierpiński-type graphs
- About \(S\)-packing coloring of 3-irregular subcubic graphs
- Packing chromatic number of cubic graphs
- About \(S\)-packing coloring of subcubic graphs
- Packing chromatic number of subdivisions of cubic graphs
- Minimally colored trees
- On \(S\)-packing coloring of 2-saturated subcubic graphs
- Partial packing coloring and quasi-packing coloring of the triangular grid
- Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs
- Packing colorings of subcubic outerplanar graphs
- A note on \(S\)-packing colorings of lattices
- Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph
- Packing chromatic number under local changes in a graph
- Packing coloring of some undirected and oriented coronae graphs
- Packing chromatic number of certain fan and wheel related graphs
- Complexity of the Packing Coloring Problem for Trees
- \(S\)-packing coloring of cubic Halin graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4820787)