Name
Abstract | ||
|---|---|---|
Semi-coloring is a new type of edge coloring of graphs. In this note, we show that every graph has a semi-coloring. This answers a problem, posed by Daniely and Linial, in affirmative. It implies that every r-regular graph has at least $${\\lceil\\frac{r}{2}\\rceil}$$ different {K 2, C i | i ¿ 3}-factors. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/s00373-012-1171-1 | Graphs and Combinatorics |
Keywords | Field | DocType |
edge coloring,factor,matching,semi-coloring | Topology,Edge coloring,Discrete mathematics,Graph,Complete coloring,Combinatorics,Fractional coloring,List coloring,Brooks' theorem,Greedy coloring,Mathematics,Graph coloring | Journal |
Volume | Issue | ISSN |
29 | 4 | 1435-5914 |
Citations | PageRank | References |
1 | 0.44 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Baoyindureng Wu | 1 | 99 | 24.68 |
| Xingchao Deng | 2 | 1 | 1.11 |
| Xinhui An | 3 | 18 | 5.55 |
| Guiying Yan | 4 | 196 | 22.92 |