Trees whose even-degree vertices induce a path are antimagic (Q2151224)
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: Trees whose even-degree vertices induce a path are antimagic |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Trees whose even-degree vertices induce a path are antimagic |
scientific article |
Statements
Trees whose even-degree vertices induce a path are antimagic (English)
0 references
1 July 2022
0 references
This paper proves that trees whose vertices of even degree induce a path are antimagic and thereby advances an affirmative step in resolving the conjecture that every simple connected graph other than \(K_2\) is antimagic.
0 references
antimagic labeling
0 references
tree
0 references
