A note on embedding hypertrees.
Loh, Po-Shen (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On rainbow trees and cycles.”
A note on embedding hypertrees.
Few colored cuts or cycles in edge colored graphs
Jiří Matoušek (1988)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
An anti-Ramsey condition on trees.
Picollelli, Michael E. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Rainbow matching in edge-colored graphs.
LeSaulnier, Timothy D., Stocker, Christopher, Wenger, Paul S., West, Douglas B. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On resolving edge colorings in graphs.
Saenpholphat, Varaporn, Zhang, Ping (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
On a problem of R. Häggkvist concerning edge-colourings of graphs
Bohdan Zelinka (1978)
Časopis pro pěstování matematiky
Similarity:
The Ramsey number of diamond-matchings and loose cycles in hypergraphs.
Gyárfás, András, Sárközy, Gábor N., Szemerédi, Endre (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Multicoloured Hamilton cycles.
Albert, Michael, Frieze, Alan, Reed, Bruce (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity: