Pages that link to "Item:Q5212951"

The following pages link to Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs (Q5212951):

Displaying 17 items.

• The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs (Q1981664) (← links)
• Anti-Ramsey numbers in complete \(k\)-partite graphs (Q2007338) (← links)
• Anti-Ramsey number of matchings in \(r\)-partite \(r\)-uniform hypergraphs (Q2075528) (← links)
• Anti-Ramsey numbers for cycles in \(n\)-prisms (Q2081461) (← links)
• Anti-Ramsey numbers for cycles in the generalized Petersen graphs (Q2148049) (← links)
• Anti-Ramsey number of matchings in a hypergraph (Q2231708) (← links)
• Rainbow numbers for paths in planar graphs (Q2242061) (← links)
• Rainbow numbers for small graphs in planar graphs (Q2287674) (← links)
• Exact rainbow numbers for matchings in plane triangulations (Q2659207) (← links)
• Anti‐Ramsey number of expansions of paths and cycles in uniform hypergraphs (Q6046647) (← links)
• Extremal \(P_8\)-free/\(P_9\)-free planar graphs (Q6047577) (← links)
• Constrained Ramsey numbers for the loose path, cycle and star (Q6056382) (← links)
• Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs (Q6100615) (← links)
• Anti-Ramsey number of matchings in outerplanar graphs (Q6145814) (← links)
• Anti-Ramsey number of disjoint union of star-like hypergraphs (Q6197696) (← links)
• The rainbow numbers of cycles in maximal bipartite planar graph (Q6585243) (← links)
• \((k-2)\)-linear connected components in hypergraphs of rank \(k\) (Q6599814) (← links)