Name
Abstract | ||
|---|---|---|
For a graph G and edges e = u(1)v(1), e' = u(2)v(2) is an element of E(G), the graph G(e, e') is obtained from G by replacing e = u(1)v(1) by a path u(1)v(e)v(1) and by replacing e' = u(2)v(2) by a path u(1)v(e), v(2), where ve, ye, are two new vertices not in V (G). A graph G is strongly spanning trailable if for any e = u(1)v(1), e' = u(2)v(2) is an element of E(G), G(e, e') has a spanning (v(e), v(e),)-trail. Luo et al. [Discrete Mathematics 306 (2006) 87-98] proved that every 4-edge-connected graph is spanning trailable. In this paper, we show that, for a 3-edge-connected graph G which is not the Wagner graph, if every pair of edges is joined by a longest path of length at most 8, then G is strongly spanning trailable. |
Year | Venue | Keywords |
|---|---|---|
2018 | ARS COMBINATORIA | supereulerian graphs,eulerian-connected graphs,spanning trailable graphs |
Field | DocType | Volume |
Discrete mathematics,Graph,Combinatorics,Mathematics | Journal | 137 |
ISSN | Citations | PageRank |
0381-7032 | 1 | 0.37 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ping Li | 1 | 21 | 7.14 |
| Keke Wang | 2 | 2 | 1.43 |
| Mingquan Zhan | 3 | 86 | 12.03 |
| Hong-Jian Lai | 4 | 631 | 97.39 |