
doi: 10.1002/jgt.10094
AbstractIn this paper, we show that if G is a 3‐edge‐connected graph with $S \subseteq V(G)$ and $|S| \le 12$, then either G has an Eulerian subgraph H such that $S \subseteq V(H)$, or G can be contracted to the Petersen graph in such a way that the preimage of each vertex of the Petersen graph contains at least one vertex in S. If G is a 3‐edge‐connected planar graph, then for any $|S|\le 23$, G has an Eulerian subgraph H such that $S\subseteq V(H)$. As an application, we obtain a new result on Hamiltonian line graphs. © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 308–319, 2003
Eulerian and Hamiltonian graphs, Computer Sciences, Eulerian subgraphs, Hamiltonian line graphs, Petersen graph, the Petersen graph, Mathematics
Eulerian and Hamiltonian graphs, Computer Sciences, Eulerian subgraphs, Hamiltonian line graphs, Petersen graph, the Petersen graph, 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). | 16 | |
| 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. | Average |
