Recommendations
Cites work
- scientific article; zbMATH DE number 3724488 (Why is no real title available?)
- scientific article; zbMATH DE number 3273761 (Why is no real title available?)
- A Theorem on Coloring the Lines of a Network
- A note on packing chromatic number of the square lattice
- Broadcast chromatic numbers of graphs
- Complexity of the packing coloring problem for trees
- Covering planar graphs with forests, one having bounded maximum degree
- Decomposition of Finite Graphs Into Forests
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
- On the packing chromatic number of some lattices
- On the packing chromatic number of square and hexagonal lattice
- Packing chromatic number of distance graphs
- Planar graphs of maximum degree seven are Class I
- The packing chromatic number of infinite product graphs
- The packing coloring of distance graphs \(D(k,t)\)
Cited in
(15)- Facial visibility in edge colored plane graphs
- Facial packing vertex-coloring of subdivided plane graphs
- A survey on packing colorings
- Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs
- Edge-coloring of plane multigraphs with many colors on facial cycles
- Edge looseness of plane graphs
- Packing chromatic number of subdivisions of cubic graphs
- Facially-constrained colorings of plane graphs: a survey
- Zig-zag facial total-coloring of plane graphs
- Facial unique-maximum edge and total coloring of plane graphs
- Facial graceful coloring of plane graphs
- Facial parity edge coloring of outerplane graphs
- Facial list colourings of plane graphs
- Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs
- Packing chromatic number of cubic graphs
This page was built for publication: Facial packing edge-coloring of plane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q313797)
