Pages that link to "Item:Q2311375"
From MaRDI portal
The following pages link to Maximum colored trees in edge-colored graphs (Q2311375):
Displaying 9 items.
- Extremal trees with respect to number of \((A, B, 2 C)\)-edge colourings (Q327737) (← links)
- Sufficient conditions for the existence of spanning colored trees in edge-colored graphs (Q442397) (← links)
- On an extremal problem for colored trees (Q1279875) (← links)
- Maximum properly colored trees in edge-colored graphs (Q2168717) (← links)
- Properly colored spanning trees in edge-colored graphs (Q2279275) (← links)
- On trees with a maximum proper partial 0-1 coloring containing a maximum matching (Q2368934) (← links)
- Spanning trees with many or few colors in edge-colored graphs (Q4210669) (← links)
- Multicolored trees in random graphs (Q4288877) (← links)
- Parallel connectivity in edge-colored complete graphs: complexity results (Q6154375) (← links)