
A graph \(G\) is called supereulerian if \(G\) has a spanning eulerian subgraph. Using a contraction method introduced by \textit{P. A. Catlin} [J. Graph Theory 12, No. 1, 29-44 (1988; Zbl 0659.05073)], the author discusses some best possible conditions for 3-edge-connected graphs to be supereulerian.
Eulerian and Hamiltonian graphs, Computer Sciences, Peterson graph, supereulerian graphs, Mathematics
Eulerian and Hamiltonian graphs, Computer Sciences, Peterson graph, supereulerian graphs, 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). | 0 | |
| 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 |
