Name
Abstract | ||
|---|---|---|
•We confirm the question in affirmative with a stronger way. It is shown that for any graph G (not necessarily subcubic bipartite) with w(e)≤5 is (1,24)-packing edge-colorable.•We also prove that every graph G with w(e)≤6 is (1,28)-packing edge-colorable.•we prove that if G is cubic graph, then it has a (1,320)-packing edge-coloring and a (1,447)-packing edge-coloring. Furthermore, if G is 3-edge-colorable, then it has a (1,318)-packing edge-coloring and a (1,442)-packing edge-coloring. These strengthen results of Gastineau and Togni (On S-packing edge-colorings of cubic graphs, Discrete Appl. Math. 259 (2019) 63–75). |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1016/j.amc.2021.126840 | Applied Mathematics and Computation |
Keywords | DocType | Volume |
Edge weight,S-Packing edge-coloring,Strong edge coloring | Journal | 418 |
ISSN | Citations | PageRank |
0096-3003 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wei Yang | 1 | 1 | 1.37 |
| Baoyindureng Wu | 2 | 0 | 0.34 |