Pages that link to "Item:Q1174783"
From MaRDI portal
The following pages link to Vertex coverings by monochromatic cycles and trees (Q1174783):
Displaying 18 items.
- Monochromatic Cycle Partitions in Local Edge Colorings (Q3466360) (← links)
- Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles (Q3527536) (← links)
- Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs (Q4625033) (← links)
- The complexity for partitioning graphs by monochromatic trees, cycles and paths (Q4652867) (← links)
- An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs (Q4920655) (← links)
- On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem (Q4959763) (← links)
- Sprinkling a Few Random Edges Doubles the Power (Q4990400) (← links)
- Monochromatic cycle partitions in random graphs (Q4993124) (← links)
- Covering 3-Edge-Colored Random Graphs with Monochromatic Trees (Q4997138) (← links)
- All Feedback Arc Sets of a Random Turán Tournament Have $\lfloor {n}/{k}\rfloor-{k}+1$ Disjoint ${k}$-Cliques (and This Is Tight) (Q4997139) (← links)
- Minimalist designs (Q5120741) (← links)
- Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles (Q5270411) (← links)
- Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles (Q5854893) (← links)
- Local colourings and monochromatic partitions in complete bipartite graphs (Q5890922) (← links)
- Local colourings and monochromatic partitions in complete bipartite graphs (Q5965537) (← links)
- Covering cycles in sparse graphs (Q6074700) (← links)
- A proof of the Erdős-Faber-Lovász conjecture (Q6093285) (← links)
- Minimum degree conditions for tight Hamilton cycles (Q6133938) (← links)
