Loading...

Multicolored parallelisms of isomorphic spanning trees

Akbari, S ; Sharif University of Technology | 2006

247 Viewed
  1. Type of Document: Article
  2. DOI: 10.1137/S0895480104446015
  3. Publisher: 2006
  4. Abstract:
  5. A subgraph in an edge-colored graph is multicolored if all its edges receive distinct colors. In this paper, we prove that a complete graph on 2m (m ≠ 2) vertices K2m can be properly edge-colored with 2m - 1 colors in such a way that the edges of K2m can De partitioned into m multicolored isomorphic spanning trees. © 2006 Society for Industrial and Applied Mathematics
  6. Keywords:
  7. Decision trees ; Edge detection ; Parallel algorithms ; Complete graph ; Isomorphic spanning trees ; Graph theory
  8. Source: SIAM Journal on Discrete Mathematics ; Volume 20, Issue 3 , 2006 , Pages 564-567 ; 08954801 (ISSN)
  9. URL: https://epubs.siam.org/doi/10.1137/S0895480104446015