Pages that link to "Item:Q5898715"

The following pages link to Multicolored trees in complete graphs (Q5898715):

Displaying 37 items.

• Edge-disjoint rainbow spanning trees in complete graphs (Q298338) (← links)
• Building graphs from colored trees (Q612947) (← links)
• Linearly many rainbow trees in properly edge-coloured complete graphs (Q723883) (← links)
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (Q1014813) (← links)
• The color-degree matrix and the number of multicolored trees in star decompositions (Q1322016) (← links)
• Edge-colorings of complete graphs that avoid polychromatic trees (Q1421517) (← links)
• On the number of rainbow spanning trees in edge-colored complete graphs (Q1637154) (← links)
• Rainbow spanning trees in properly coloured complete graphs (Q1671318) (← links)
• Edge-disjoint rainbow trees in properly coloured complete graphs (Q1690046) (← links)
• Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations (Q1727772) (← links)
• The rainbow spanning forest problem (Q1797922) (← links)
• On multicolored forests in complete bipartite graphs (Q1879163) (← links)
• Rainbow and properly colored spanning trees in edge-colored bipartite graphs (Q2051897) (← links)
• On the number of heterochromatic trees in nice and beautiful colorings of complete graphs (Q2062897) (← links)
• Special case of Rota's basis conjecture on graphic matroids (Q2088711) (← links)
• Maximum properly colored trees in edge-colored graphs (Q2168717) (← links)
• Color degree sum conditions for properly colored spanning trees in edge-colored graphs (Q2198384) (← links)
• Decompositions into isomorphic rainbow spanning trees (Q2221934) (← links)
• Symbolic coloured SCC decomposition (Q2233494) (← links)
• Properly colored spanning trees in edge-colored graphs (Q2279275) (← links)
• A generalization of heterochromatic graphs and \(f\)-chromatic spanning forests (Q2376091) (← links)
• Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs (Q2422235) (← links)
• On the complexity of packing rainbow spanning trees (Q2685331) (← links)
• Quaternionic 1-factorizations and complete sets of rainbow spanning trees (Q2689122) (← links)
• Anti-Ramsey problems for \(t\) edge-disjoint rainbow spanning subgraphs: cycles, matchings, or trees (Q2811196) (← links)
• Multicolored isomorphic spanning trees in complete graphs. (Q2823226) (← links)
• Rainbow faces in edge‐colored plane graphs (Q3652543) (← links)
• (Q3979791) (← links)
• An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles (Q4960448) (← links)
• (Q5000298) (← links)
• (Q5094123) (← links)
• Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees (Q5139656) (← links)
• $(g,f)$-Chromatic spanning trees and forests (Q5197593) (← links)
• Special monochromatic trees in two-colored complete graphs (Q5284596) (← links)
• Multicolored Parallelisms of Isomorphic Spanning Trees (Q5757372) (← links)
• Multicolored trees in complete graphs (Q5904060) (← links)
• Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs (Q6100615) (← links)