Pages that link to "Item:Q1421517"
From MaRDI portal
The following pages link to Edge-colorings of complete graphs that avoid polychromatic trees (Q1421517):
Displaying 41 items.
- Anti-Ramsey numbers in complete split graphs (Q279216) (← links)
- On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids (Q367058) (← links)
- Anti-Ramsey coloring for matchings in complete bipartite graphs (Q512859) (← links)
- Rainbows in the hypercube (Q879943) (← links)
- Rainbow numbers for cycles with pendant edges (Q1014810) (← links)
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (Q1014813) (← links)
- Complete solution for the rainbow numbers of matchings (Q1025962) (← links)
- On maximum face-constrained coloring of plane graphs with no short face cycles. (Q1426126) (← links)
- Edge-colorings with no large polychromatic stars (Q1606032) (← 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)
- Anti-Ramsey numbers of subdivided graphs (Q1850619) (← links)
- The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs (Q1981664) (← 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)
- Polychromatic colorings of 1-regular and 2-regular subgraphs of complete graphs (Q2142635) (← links)
- Improved approximation for maximum edge colouring problem (Q2161229) (← links)
- Anti-Ramsey number of matchings in a hypergraph (Q2231708) (← links)
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings (Q2334066) (← links)
- The smallest uniform color-bounded hypergraphs which are one-realizations of a given set (Q2409524) (← links)
- Bounds for bipartite rainbow Ramsey numbers (Q2409541) (← links)
- Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number (Q2509762) (← links)
- On the anti-Ramsey number of forests (Q2659067) (← links)
- Anti-Ramsey numbers for trees in complete multi-partite graphs (Q2675857) (← links)
- Anti-Ramsey problems for \(t\) edge-disjoint rainbow spanning subgraphs: cycles, matchings, or trees (Q2811196) (← links)
- Bipartite anti-Ramsey numbers of cycles (Q3156920) (← links)
- Rainbow numbers for certain graphs (Q3439415) (← links)
- Anti-Ramsey numbers of doubly edge-critical graphs (Q3652531) (← links)
- Edge-Coloring Partialk-Trees (Q3837389) (← links)
- Anti-Ramsey numbers for disjoint copies of graphs (Q4690986) (← links)
- Complexity of Computing the Anti-Ramsey Numbers for Paths. (Q5089164) (← links)
- Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees (Q5139656) (← links)
- Anti-Ramsey numbers for matchings in regular bipartite graphs (Q5347253) (← links)
- (Q5708606) (← links)
- Anti-Ramsey problems in the Mycielskian of a cycle (Q6048647) (← 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)
- Approximating maximum edge 2-coloring by normalizing graphs (Q6574923) (← links)
