
In this paper, Grinberg equation related to the Hamiltonicity of cubic planar graphs is revisited using the cycle base description of the graph and the related Laplacian. The advantages and the limitations of a pure Algebraic approach to Hamiltonicity are shown. Examples, showing the limitations are presented, too. Further possible approaches are suggested. Some unexpected results are shown, too.
Hamiltonicity, Hamiltonian cycle, Electronic computers. Computer science, QA1-939, Planar graphs, Cycles Base, QA75.5-76.95, Laplacian, Grinberg equation, Mathematics
Hamiltonicity, Hamiltonian cycle, Electronic computers. Computer science, QA1-939, Planar graphs, Cycles Base, QA75.5-76.95, Laplacian, Grinberg equation, Mathematics
| 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). | 4 | |
| 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). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
