Pages that link to "Item:Q1606032"
From MaRDI portal
The following pages link to Edge-colorings with no large polychromatic stars (Q1606032):
Displaying 44 items.
- Anti-Ramsey numbers in complete split graphs (Q279216) (← links)
- Edge-colorings avoiding fixed rainbow stars (Q324811) (← links)
- Approximation and hardness results for the maximum edge \(q\)-coloring problem (Q350721) (← links)
- Vertex coloring without large polychromatic stars (Q432703) (← links)
- Anti-Ramsey coloring for matchings in complete bipartite graphs (Q512859) (← links)
- Rainbow generalizations of Ramsey theory: A survey (Q604649) (← links)
- An anti-Ramsey theorem on diamonds (Q604664) (← links)
- Rainbow numbers for cycles with pendant edges (Q1014810) (← links)
- Complete solution for the rainbow numbers of matchings (Q1025962) (← links)
- Edge colouring of \(K_{2n}\) with spanning star-forests receiving distinct colours (Q1300004) (← links)
- Edge-colorings of complete graphs that avoid polychromatic trees (Q1421517) (← links)
- Maximum face-constrained coloring of plane graphs (Q1421525) (← links)
- On maximum face-constrained coloring of plane graphs with no short face cycles. (Q1426126) (← links)
- Two-edge colorings of graphs with bounded degree in both colors (Q1598846) (← links)
- Anti-Ramsey number of Hanoi graphs (Q1630944) (← 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)
- The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs (Q1981664) (← links)
- Edge colorings of graphs without monochromatic stars (Q2005736) (← links)
- Anti-Ramsey numbers in complete \(k\)-partite graphs (Q2007338) (← links)
- On the maximal colorings of complete graphs without some small properly colored subgraphs (Q2053693) (← links)
- Anti-Ramsey numbers for cycles in \(n\)-prisms (Q2081461) (← links)
- Anti-Ramsey numbers for vertex-disjoint triangles (Q2092342) (← links)
- Improved monochromatic double stars in edge colorings (Q2121489) (← links)
- On \(\mathrm{M}_f\)-edge colorings of graphs (Q2158189) (← links)
- Improved approximation for maximum edge colouring problem (Q2161229) (← links)
- Anti-Ramsey number of matchings in a hypergraph (Q2231708) (← links)
- The smallest uniform color-bounded hypergraphs which are one-realizations of a given set (Q2409524) (← links)
- On the anti-Ramsey number of forests (Q2659067) (← links)
- Bipartite anti-Ramsey numbers of cycles (Q3156920) (← links)
- Rainbow numbers for certain graphs (Q3439415) (← links)
- Large Monochromatic Triple Stars in Edge Colourings (Q3466347) (← links)
- Totally Multicolored diamonds (Q3503558) (← links)
- Anti-Ramsey numbers for disjoint copies of graphs (Q4690986) (← links)
- Anti-Ramsey Hypergraph Numbers (Q5061691) (← links)
- Complexity of Computing the Anti-Ramsey Numbers for Paths. (Q5089164) (← links)
- Anti-Ramsey numbers for matchings in regular bipartite graphs (Q5347253) (← links)
- (Q5708587) (← links)
- (Q5708606) (← links)
- Anti-Ramsey problems in the Mycielskian of a cycle (Q6048647) (← links)
- Anti-Ramsey number of matchings in outerplanar graphs (Q6145814) (← links)
- New bounds on the anti-Ramsey numbers of star graphs via maximum edge \(q\)-coloring (Q6197752) (← links)
- Approximating maximum edge 2-coloring by normalizing graphs (Q6574923) (← links)
