Edge coloring of planar graphs which any two short cycles are adjacent at most once (Q385973)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Edge coloring of planar graphs which any two short cycles are adjacent at most once |
scientific article |
Statements
Edge coloring of planar graphs which any two short cycles are adjacent at most once (English)
0 references
13 December 2013
0 references
planar graph
0 references
edge coloring
0 references
maximum degree
0 references
cycle
0 references
