Pages that link to "Item:Q1883265"
From MaRDI portal
The following pages link to Rainbow numbers for matchings and complete graphs (Q1883265):
Displaying 11 items.
- Anti-Ramsey Hypergraph Numbers (Q5061691) (← links)
- Complexity of Computing the Anti-Ramsey Numbers for Paths. (Q5089164) (← links)
- Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs (Q5212951) (← links)
- Anti-Ramsey numbers for matchings in regular bipartite graphs (Q5347253) (← links)
- Rainbow cliques in edge-colored graphs (Q5964266) (← links)
- Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs (Q6046825) (← links)
- Anti-Ramsey number of matchings in outerplanar graphs (Q6145814) (← links)
- Anti-Ramsey number for perfect matchings in 3-regular bipartite graphs (Q6542038) (← links)
- Approximating maximum edge 2-coloring by normalizing graphs (Q6574923) (← links)
- Rainbow disjoint union of \(P_4\) and a matching in complete graphs (Q6585524) (← links)
- Rainbow short linear forests in edge-colored complete graph (Q6657254) (← links)