Pages that link to "Item:Q1014813"
From MaRDI portal
The following pages link to Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (Q1014813):
Displaying 21 items.
- On \(s\)--\(t\) paths and trails in edge-colored graphs (Q2840541) (← links)
- A note on rainbow matchings (Q2874039) (← links)
- Large rainbow matchings in edge-coloured graphs (Q2883866) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- A 0.3622-Approximation Algorithm for the Maximum k-Edge-Colored Clustering Problem (Q4965094) (← links)
- (Q5089171) (← links)
- (Q5094123) (← links)
- Parameterized Algorithms and Kernels for Rainbow Matching (Q5111288) (← links)
- $(g,f)$-Chromatic spanning trees and forests (Q5197593) (← links)
- Transversals in generalized Latin squares (Q5225021) (← links)
- Assessing the Computational Complexity of Multi-layer Subgraph Detection (Q5283362) (← links)
- Anti-Ramsey numbers for matchings in regular bipartite graphs (Q5347253) (← links)
- Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting (Q5397732) (← links)
- A Dirac Type Condition for Properly Coloured Paths and Cycles (Q5418769) (← links)
- Rainbow cliques in edge-colored graphs (Q5964266) (← links)
- On heterochromatic out-directed spanning trees in tournaments (Q5964994) (← links)
- Minimum <scp>color‐degree</scp> perfect <i>b</i>‐matchings (Q6087129) (← links)
- Edge-disjoint properly colored cycles in edge-colored complete graphs (Q6126721) (← links)
- Anti-Ramsey number of matchings in outerplanar graphs (Q6145814) (← links)
- Monochromatic and heterochromatic subgraph problems in a randomly colored graph (Q6207597) (← links)
- Counting rainbow triangles in edge-colored graphs (Q6657585) (← links)
