Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles (Q5918364)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7380861
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles |
scientific article; zbMATH DE number 7380861 |
Statements
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles (English)
0 references
11 August 2021
0 references
acyclic edge coloring
0 references
planar graph
0 references
intersecting triangles
0 references
discharging
0 references
induction
0 references
0 references
0.9918270111083984
0 references
0.9176698327064514
0 references
0.9057444334030152
0 references
0.9010159969329834
0 references
