Loading...
Please wait, while we are loading the content...
Similar Documents
Total colorings of planar graphs with maximum degree at least 8
| Content Provider | Semantic Scholar |
|---|---|
| Author | Shen, Lan Wang, Yingqian |
| Copyright Year | 2009 |
| Abstract | Planar graphs with maximum degree Δ ⩾ 8 and without 5- or 6-cycles with chords are proved to be (δ + 1)-totally-colorable. |
| Starting Page | 1733 |
| Ending Page | 1742 |
| Page Count | 10 |
| File Format | PDF HTM / HTML |
| DOI | 10.1007/s11425-008-0155-3 |
| Volume Number | 52 |
| Alternate Webpage(s) | https://page-one.springer.com/pdf/preview/10.1007/s11425-008-0155-3 |
| Alternate Webpage(s) | http://www.researchgate.net/profile/Yingqian_Wang/publication/226115122_Total_colorings_of_planar_graphs_with_maximum_degree_at_least_8/links/0deec51bf9bb943570000000.pdf |
| Alternate Webpage(s) | https://doi.org/10.1007/s11425-008-0155-3 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |