Pages that link to "Item:Q512859"
From MaRDI portal
The following pages link to Anti-Ramsey coloring for matchings in complete bipartite graphs (Q512859):
Displaying 17 items.
- Avoiding rainbow 2-connected subgraphs (Q527226) (← links)
- Rainbow number of matchings in planar graphs (Q1660271) (← links)
- Extremal coloring for the anti-Ramsey problem of matchings in complete graphs (Q1679499) (← links)
- Anti-Ramsey numbers for matchings in 3-regular bipartite graphs (Q1732824) (← links)
- Rainbow matchings in edge-colored complete split graphs (Q1746587) (← links)
- Anti-Ramsey colorings in several rounds (Q1850529) (← links)
- Anti-Ramsey numbers in complete \(k\)-partite graphs (Q2007338) (← links)
- Improved bounds for anti-Ramsey numbers of matchings in outer-planar graphs (Q2073118) (← links)
- Anti-Ramsey number of matchings in \(r\)-partite \(r\)-uniform hypergraphs (Q2075528) (← links)
- Anti-Ramsey numbers for cycles in the generalized Petersen graphs (Q2148049) (← links)
- Rainbow matchings in an edge-colored planar bipartite graph (Q2161844) (← links)
- Anti-Ramsey number of matchings in a hypergraph (Q2231708) (← links)
- Rainbow triangles in edge-colored Kneser graphs (Q2284337) (← links)
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings (Q2334066) (← links)
- Application of queueing theory in dispensation of resources and optimization in teleconsultation (Q2657598) (← links)
- Anti-Ramsey numbers for matchings in regular bipartite graphs (Q5347253) (← links)
- Rainbow disjoint union of \(P_4\) and a matching in complete graphs (Q6585524) (← links)