Recommendations
Cites work
- scientific article; zbMATH DE number 3724488 (Why is no real title available?)
- scientific article; zbMATH DE number 5033869 (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 polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs
- Covering planar graphs with forests, one having bounded maximum degree
- Decomposition of Finite Graphs Into Forests
- Edge ranking of graphs is hard
- Edge ranking of weighted trees
- Improved bound on facial parity edge coloring
- On minimum edge ranking spanning trees
- On the facial Thue choice index via entropy compression
- On-line ranking number for cycles and paths
- Optimal edge ranking of trees in polynomial time
- Planar graphs of maximum degree seven are Class I
- Rainbow faces in edge-colored plane graphs
- Rankings of Graphs
- Topological graph theory.
- -facial edge colorings of graphs
Cited in
(2)
This page was built for publication: Facial edge ranking of plane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494424)
