Facial packing edge-coloring of plane graphs

DOI10.1016/j.dam.2016.05.010zbMath1344.05061OpenAlexW2412016639MaRDI QIDQ313797

Július Czap, Stanlislav Jendroľ

Publication date: 12 September 2016

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

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

zbMATH Keywords

plane graphfacial packing edge-coloring

Mathematics Subject Classification ID

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

Related Items

Facially-constrained colorings of plane graphs: a survey, Packing chromatic number of cubic graphs, Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs, A survey on packing colorings, Packing chromatic number of subdivisions of cubic graphs, Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Packing chromatic number of distance graphs
• 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
• Planar graphs of maximum degree seven are Class I
• A note on packing chromatic number of the square lattice
• The packing coloring of distance graphs \(D(k,t)\)
• On the packing chromatic number of square and hexagonal lattice
• Decomposition of Finite Graphs Into Forests
• A Theorem on Coloring the Lines of a Network
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees