The following pages link to (Q4075490):
Displaying 45 items.
- Improved approximation for maximum edge colouring problem (Q2161229) (← links)
- Rainbow matchings in an edge-colored planar bipartite graph (Q2161844) (← links)
- Anti-Ramsey number of matchings in a hypergraph (Q2231708) (← links)
- Rainbow numbers for paths in planar graphs (Q2242061) (← links)
- Anti-Ramsey problems for cycles (Q2243332) (← links)
- A note on the monotonicity of mixed Ramsey numbers (Q2275461) (← links)
- Rainbow numbers for small graphs in planar graphs (Q2287674) (← links)
- Planar anti-Ramsey numbers of paths and cycles (Q2324510) (← links)
- On rainbow matchings in plane triangulations (Q2329209) (← links)
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings (Q2334066) (← links)
- Facial rainbow edge-coloring of plane graphs (Q2413633) (← links)
- On sufficient conditions for rainbow cycles in edge-colored graphs (Q2421861) (← links)
- Planar anti-Ramsey numbers of matchings (Q2421877) (← links)
- On the balanced upper chromatic number of cyclic projective planes and projective spaces (Q2515603) (← links)
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning trees (Q2657096) (← links)
- On the anti-Ramsey number of forests (Q2659067) (← links)
- Exact rainbow numbers for matchings in plane triangulations (Q2659207) (← links)
- On odd rainbow cycles in edge-colored graphs (Q2662803) (← links)
- Complete edge-colored permutation graphs (Q2672966) (← links)
- Rainbow-free 3-colorings in abelian groups (Q2851452) (← links)
- Rainbow numbers for certain graphs (Q3439415) (← links)
- Totally Multicolored diamonds (Q3503558) (← links)
- Anti-Ramsey numbers for disjoint copies of graphs (Q4690986) (← links)
- (Q5042377) (← links)
- Anti-Ramsey Hypergraph Numbers (Q5061691) (← links)
- Complexity of Computing the Anti-Ramsey Numbers for Paths. (Q5089164) (← links)
- Constructive Methods in Gallai-Ramsey Theory for Hypergraphs (Q5109420) (← links)
- Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees (Q5139656) (← links)
- $(g,f)$-Chromatic spanning trees and forests (Q5197593) (← links)
- Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs (Q5212951) (← links)
- Transversals in generalized Latin squares (Q5225021) (← links)
- Anti-Ramsey numbers for matchings in regular bipartite graphs (Q5347253) (← links)
- Rainbow cliques in edge-colored graphs (Q5964266) (← links)
- Anti‐Ramsey number of expansions of paths and cycles in uniform hypergraphs (Q6046647) (← links)
- Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs (Q6046825) (← links)
- Anti-Ramsey problems in the Mycielskian of a cycle (Q6048647) (← links)
- Constrained Ramsey numbers for the loose path, cycle and star (Q6056382) (← links)
- Rainbow subgraphs in edge-colored planar and outerplanar graphs (Q6063835) (← links)
- The Erdős–Gyárfás function with respect to Gallai‐colorings (Q6081587) (← links)
- Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs (Q6100615) (← links)
- Computing the anti-Ramsey number for trees in complete tripartite graph (Q6108022) (← links)
- Turán numbers and anti-Ramsey numbers for short cycles in complete \(3\)-partite graphs (Q6162143) (← links)
- Properly colored and rainbow C4 ${C}_{4}$'s in edge‐colored graphs (Q6183431) (← links)
- Anti-Ramsey number of disjoint union of star-like hypergraphs (Q6197696) (← links)
- New bounds on the anti-Ramsey numbers of star graphs via maximum edge \(q\)-coloring (Q6197752) (← links)