Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles (Q5918607)
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: Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles |
scientific article; zbMATH DE number 7636454
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles |
scientific article; zbMATH DE number 7636454 |
Statements
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles (English)
0 references
22 December 2022
0 references
acyclic edge coloring
0 references
planar graph
0 references
intersecting triangles
0 references
discharging
0 references
induction
0 references
0 references
