Pages that link to "Item:Q1174783"
From MaRDI portal
The following pages link to Vertex coverings by monochromatic cycles and trees (Q1174783):
Displaying 40 items.
- Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles (Q2800590) (← links)
- Partitioning 3-coloured complete graphs into three monochromatic paths (Q2857433) (← links)
- Monochromatic cycle partitions of edge-colored graphs (Q3067062) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Packing the Boolean lattice with copies of a poset (Q3296748) (← links)
- One-sided coverings of colored complete bipartite graphs (Q3424878) (← links)
- Monochromatic Cycle Partitions in Local Edge Colorings (Q3466360) (← links)
- Monochromatic coverings in colored complete graphs (Q3483311) (← links)
- Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles (Q3527536) (← links)
- (Q3977492) (← links)
- (Q4014421) (← links)
- On partition theorems for finite graphs (Q4087229) (← links)
- Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles (Q4238172) (← links)
- Monochromatic cycle covers in random graphs (Q4625023) (← 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)
- Vertex covering with monochromatic paths (Q4841660) (← 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)
- Covering complete graphs by monochromatically bounded sets (Q5028797) (← links)
- On the VC-dimension, covering and separating properties of the cycle and spanning tree hypergraphs of graphs (Q5103874) (← 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)
- Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles (Q6046228) (← links)
- Covering cycles in sparse graphs (Q6074700) (← links)
- Covering random graphs with monochromatic trees (Q6074874) (← links)
- A proof of the Erdős-Faber-Lovász conjecture (Q6093285) (← links)
- Minimum degree conditions for tight Hamilton cycles (Q6133938) (← links)
- Transference for loose Hamilton cycles in random 3-uniform hypergraphs (Q6596385) (← links)
- Partitioning a 2-edge-coloured graph of minimum degree \(2n/3 + o(n)\) into three monochromatic cycles (Q6612514) (← links)
- Tiling edge-coloured graphs with few monochromatic bounded-degree graphs (Q6621182) (← links)
- Covering 3-coloured random graphs with monochromatic trees (Q6621232) (← links)
- Spanning subdivisions in dense digraphs (Q6655689) (← links)