Name
Abstract | ||
|---|---|---|
An incidence in a graph G is a pair (v, e) where v is a vertex of G and e is an edge of G incident to v. Two incidences (v, e) and (u, f) are adjacent if at least one of the following holds: $$(a) v = u, (b) e = f$$(a)v=u,(b)e=f, or $$(c) vu \\in \\{e,f\\}$$(c)vuź{e,f}. An incidence coloring of G is a coloring of its incidences assigning distinct colors to adjacent incidences. In this note we prove that every subquartic graph admits an incidence coloring with at most seven colors. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s10878-016-0072-2 | J. Comb. Optim. |
Keywords | Field | DocType |
Incidence coloring,Subquartic graph,Incidence chromatic number | Graph,Discrete mathematics,Combinatorics,Chromatic scale,Vertex (geometry),Incidence coloring,Mathematics | Journal |
Volume | Issue | ISSN |
34 | 1 | 1382-6905 |
Citations | PageRank | References |
1 | 0.37 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Petr Gregor | 1 | 178 | 19.79 |
| Borut Luzar | 2 | 42 | 10.86 |
| Roman Soták | 3 | 128 | 24.06 |