Facial packing vertex-coloring of subdivided plane graphs

DOI10.1016/J.DAM.2018.10.022zbMath1503.05041OpenAlexW2900986164MaRDI QIDQ1730225

Július Czap, Juraj Valiska, Peter Šugerek, Stanlislav Jendroľ

Publication date: 11 March 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.10.022

zbMATH Keywords

subdivisionplane graphvertex-coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

A survey on packing colorings ⋮ \(S\)-packing chromatic vertex-critical graphs

Cites Work

• Unnamed Item
• Unnamed Item
• \(S\)-packing colorings of cubic graphs
• Packing chromatic number of distance 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
• Covering planar graphs with forests, one having bounded maximum degree
• The packing chromatic number of infinite product graphs
• Packing chromatic number of cubic graphs
• A note on packing chromatic number of the square lattice
• Facially-constrained colorings of plane graphs: a survey
• Facial rainbow edge-coloring of plane graphs
• The packing coloring of distance graphs \(D(k,t)\)
• On the packing chromatic number of square and hexagonal lattice
• Trees in Polyhedral Graphs
• Decomposition of Finite Graphs Into Forests
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees

This page was built for publication: Facial packing vertex-coloring of subdivided plane graphs