Facial edge ranking of plane graphs (Q494424)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Facial edge ranking of plane graphs	scientific article

Statements

scholarly article

0 references

Facial edge ranking of plane graphs (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.dam.2015.05.011

0 references

0 references

Stanlislav Jendroľ

0 references

Discrete Applied Mathematics

0 references

publication date

1 September 2015

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

facial edge ranking

0 references

plane graph

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.dam.2015.05.011

0 references

0 references

Rankings of Graphs

0 references

On-line ranking number for cycles and paths

0 references

Optimal edge ranking of trees in polynomial time

0 references

Edge ranking of weighted trees

0 references

0 references

Covering planar graphs with forests, one having bounded maximum degree

0 references

0 references

Rainbow faces in edge‐colored plane graphs

0 references

Edge ranking of graphs is hard

0 references

\(\ell\)-facial edge colorings of graphs

0 references

Improved bound on facial parity edge coloring

0 references

On Minimum Edge Ranking Spanning Trees

0 references

A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs

0 references

Decomposition of Finite Graphs Into Forests

0 references

On the Facial Thue Choice Index via Entropy Compression

0 references

0 references

Planar graphs of maximum degree seven are Class I

0 references

A Theorem on Coloring the Lines of a Network

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:494424

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q494424&oldid=36198521"