Sufficient conditions for the existence of spanning colored trees in edge-colored graphs
From MaRDI portal
Publication:442397
DOI10.1016/j.disc.2012.01.031zbMath1246.05049MaRDI QIDQ442397
Valentin Borozan, Yannis Manoussakis, Raquel Águeda, Rahul Muthu, Gervais Mendy
Publication date: 10 August 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.01.031
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- DNA physical mapping and alternating Eulerian cycles in colored graphs
- Maximum colored trees in edge-colored graphs
- A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
- Characterization of edge-colored complete graphs with properly colored Hamilton paths
- Graph folding and programmable logic array
- The Parallel Evaluation of General Arithmetic Expressions
- Multicolored trees in complete graphs
- Multicolored forests in complete bipartite graphs