Facial edge ranking of plane graphs

DOI10.1016/j.dam.2015.05.011zbMath1319.05112OpenAlexW420954237MaRDI QIDQ494424

Július Czap, Stanlislav Jendroľ

Publication date: 1 September 2015

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

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

zbMATH Keywords

plane graphfacial edge ranking

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

Facially-constrained colorings of plane graphs: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bound on facial parity edge coloring
• \(\ell\)-facial edge colorings of graphs
• Covering planar graphs with forests, one having bounded maximum degree
• Edge ranking of graphs is hard
• Planar graphs of maximum degree seven are Class I
• Optimal edge ranking of trees in polynomial time
• A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs
• Edge ranking of weighted trees
• On Minimum Edge Ranking Spanning Trees
• Rainbow faces in edge‐colored plane graphs
• Rankings of Graphs
• On-line ranking number for cycles and paths
• Decomposition of Finite Graphs Into Forests
• A Theorem on Coloring the Lines of a Network

This page was built for publication: Facial edge ranking of plane graphs