Name
Abstract | ||
|---|---|---|
We show that “almost all” generalized Petersen graphs have total chromatic number 4. More precisely: for each integer k≥2, there exists an integer N(k) such that, for any n≥N(k), the generalized Petersen graph G(n,k) has total chromatic number 4. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.disc.2015.12.010 | Discrete Mathematics |
Keywords | Field | DocType |
Total coloring,Cubic graph,Generalized Petersen graph | Odd graph,Discrete mathematics,Edge coloring,Total coloring,Combinatorics,Generalized Petersen graph,Nowhere-zero flow,Brooks' theorem,Petersen family,Petersen graph,Mathematics | Journal |
Volume | Issue | ISSN |
339 | 5 | 0012-365X |
Citations | PageRank | References |
2 | 0.43 | 10 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Simone Dantas | 1 | 119 | 24.99 |
| C.M.H. de Figueiredo | 2 | 21 | 2.72 |
| Giuseppe Mazzuoccolo | 3 | 32 | 15.91 |
| Myriam Preissmann | 4 | 192 | 19.43 |
| V. F. dos Santos | 5 | 3 | 1.25 |
| D. Sasaki | 6 | 7 | 3.94 |