
arXiv: 2106.10368
If the line graph of a graph $G$ decomposes into Hamiltonian cycles, what is $G$? We answer this question for decomposition into two cycles.
4 pp
line graph, Eulerian and Hamiltonian graphs, Primary 05C45, Secondary 05C76, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph operations (line graphs, products, etc.), Hamilton decomposition, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO)
line graph, Eulerian and Hamiltonian graphs, Primary 05C45, Secondary 05C76, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph operations (line graphs, products, etc.), Hamilton decomposition, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
