Edge coloring of planar graphs which any two short cycles are adjacent at most once (Q385973)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Edge coloring of planar graphs which any two short cycles are adjacent at most once |
scientific article; zbMATH DE number 6237905
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge coloring of planar graphs which any two short cycles are adjacent at most once |
scientific article; zbMATH DE number 6237905 |
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
0.9280350208282472
0 references
0.9097664952278136
0 references
0.9063056707382202
0 references
0.8976560235023499
0 references
0.8955449461936951
0 references
