Name
Abstract | ||
|---|---|---|
Necessary conditions for a simple connected graph G to admit a decomposition into closed trails of length k ≥ 3 are that G is even and its total number of edges is a multiple of k. In this paper we show that these conditions are sufficient in the case when G is the complete equipartite graph having at least three parts, each of the same size. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/s00373-010-0899-8 | Graphs and Combinatorics |
Keywords | Field | DocType |
simple connected graph,total number,complete equipartite graphs,complete equipartite graph,length k,closed trails,necessary condition,graph decomposition · closed trails · equipartite graph,connected graph | Discrete mathematics,Complete graph,Topology,Combinatorics,Line graph,Edge-transitive graph,Graph power,Cycle graph,Graph minor,Windmill graph,Mathematics,Complement graph | Journal |
Volume | Issue | ISSN |
26 | 1 | 1435-5914 |
Citations | PageRank | References |
1 | 0.36 | 6 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Benjamin R. Smith | 1 | 27 | 5.66 |