Cargando…
A Linear-Time Algorithm for 4-Coloring Some Classes of Planar Graphs
Every graph G=(V, E) considered in this paper consists of a finite set V of vertices and a finite set E of edges, together with an incidence function that associates each edge e ∈ E of G with an unordered pair of vertices of G which are called the ends of the edge e. A graph is said to be a planar g...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Hindawi
2021
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8510826/ https://www.ncbi.nlm.nih.gov/pubmed/34650606 http://dx.doi.org/10.1155/2021/7667656 |