| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6871467 | Discrete Applied Mathematics | 2018 | 7 Pages |
Abstract
In this paper, we prove the following results using the well-known discharging method. For a graph G, if mad(G)<125, then Ï3(G)â¤6; if mad(G)<73, then Ï3(G)â¤5; if G has no C5-components and mad(G)<83, then Ï2(G)â¤4.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Jian Cheng, Hong-Jian Lai, Kate J. Lorenzen, Rong Luo, Joshua C. Thompson, Cun-Quan Zhang,