Cones of closed alternating walks and trails
β Scribed by Amitava Bhattacharya; Uri N. Peled; Murali K. Srinivasan
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 221 KB
- Volume
- 423
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We prove that any complete multipartite graph with parts of even size can be decomposed into closed trails with prescribed even lengths.
A taxonomic study on 14 cone and needle traits of 281 trees from 33 provenances of Pinus oocarpa, P. oocarpa var . ochoterenae, P. patula var . longipedunculata, P. patula var . patula and P. tecunumanii in Central America and Mexico was conducted to quantify the affinity between closely related spe
A graph is partially 2-edge-colored if edges of G are colored by two colors, possibly with some edges uncolored. A walk is alternating in a partially 2-edge-colored graph if the given 2edge-coloring can be extended to all edges of G such that colors alternate as the walk is traversed. We present a p