Name
Abstract | ||
|---|---|---|
The problem of arbitrary decomposition of a graph G into closed trails i.e. a decomposition into closed trails of prescribed lengths summing up to the size of the graph G was first considered in the case of the complete graph G=K"n (for odd n) in connection with vertex-distinguishing coloring of the union of cycles. Next, the same problem was investigated for other families of graphs. In this paper we consider a more general problem: arbitrary decomposition of a graph into open and closed trails. Our results are based on and generalize known results on decomposition of a graph into closed trails. Our results also generalize some results concerning decomposition of a graph into open trails. We here emphasize that the known results on the closed case are basic ingredients for the proof of the open and closed case. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.disc.2008.03.004 | Discrete Mathematics |
Keywords | Field | DocType |
trail,decomposition,complete graph | Strength of a graph,Discrete mathematics,Combinatorics,Line graph,Graph power,Graph factorization,Cubic graph,Null graph,Mathematics,Voltage graph,Complement graph | Journal |
Volume | Issue | ISSN |
309 | 6 | Discrete Mathematics |
Citations | PageRank | References |
1 | 0.39 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sylwia Cichacz | 1 | 59 | 21.39 |
| Yoshimi Egawa | 2 | 1 | 0.39 |
| Mariusz Woźniak | 3 | 204 | 34.54 |