Pages that link to "Item:Q793052"
From MaRDI portal
The following pages link to On restricted colourings of \(K_ n\) (Q793052):
Displaying 44 items.
- Anti-Ramsey numbers of graphs with small connected components (Q292266) (← links)
- Maximum number of colors: C-coloring and related problems (Q408951) (← 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)
- The rainbow number of matchings in regular bipartite graphs (Q735110) (← links)
- Bipartite rainbow numbers of matchings (Q1025529) (← links)
- Complete solution for the rainbow numbers of matchings (Q1025962) (← 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)
- \((k,\lambda)\)-anti-powers and other patterns in words (Q1630893) (← links)
- Rainbow number of matchings in planar graphs (Q1660271) (← links)
- On the approximability of the minimum rainbow subgraph problem and other related problems (Q1679237) (← 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)
- On Erdős-Rado numbers (Q1842571) (← links)
- Anti-Ramsey colorings in several rounds (Q1850529) (← links)
- Anti-Ramsey numbers of subdivided graphs (Q1850619) (← links)
- Rainbow numbers for matchings and complete graphs (Q1883265) (← links)
- On the extremal combinatorics of the Hamming space (Q1894014) (← links)
- On the anti-Ramsey numbers of linear forests (Q2005724) (← links)
- On the maximal colorings of complete graphs without some small properly colored subgraphs (Q2053693) (← links)
- Anti-Ramsey numbers for vertex-disjoint triangles (Q2092342) (← links)
- An anti-Ramsey theorem of \(k\)-restricted edge-cuts (Q2159228) (← links)
- Improved approximation for maximum edge colouring problem (Q2161229) (← links)
- Anti-Ramsey number of matchings in a hypergraph (Q2231708) (← links)
- Anti-Ramsey problems for cycles (Q2243332) (← links)
- Better lower and upper bounds for the minimum rainbow subgraph problem (Q2250438) (← links)
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings (Q2334066) (← links)
- Minimal colorings for properly colored subgraphs (Q2563425) (← links)
- An anti-Ramsey theorem on cycles (Q2573806) (← links)
- On the anti-Ramsey number of forests (Q2659067) (← links)
- Rainbow numbers for certain graphs (Q3439415) (← links)
- Totally Multicolored diamonds (Q3503558) (← 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)
- An anti-Ramsey theorem (Q5902976) (← links)
- On heterochromatic out-directed spanning trees in tournaments (Q5964994) (← links)
- Balanced edge-colorings avoiding rainbow cliques of size four (Q6133158) (← links)
- New bounds on the anti-Ramsey numbers of star graphs via maximum edge \(q\)-coloring (Q6197752) (← links)
- Rainbow subgraphs in edge‐colored complete graphs: Answering two questions by Erdős and Tuza (Q6201025) (← links)
