Cartesian积与邻点可区别着色之间的关系(Relation between Cartesian product and adjacent vertex distinguishing coloring)
A proper k-edge coloring of a graph G is an assignment of k colors 1, 2, …, k to edges of G such that any two adjacent edges receive the different colors. For a proper edge coloring f of G and any vertex x of G, we use Sf(x) or S(x) to denote the set of the colors assigned to the edges incident with...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Zhejiang University Press
2017-09-01
|
| Series: | Zhejiang Daxue xuebao. Lixue ban |
| Subjects: | |
| Online Access: | https://doi.org/10.3785/j.issn.1008-9497.2017.05.004 |