Pages that link to "Item:Q2800590"
From MaRDI portal
The following pages link to Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles (Q2800590):
Displaying 7 items.
- Ramsey number of paths and connected matchings in Ore-type host graphs (Q267181) (← links)
- Large monochromatic components in edge colored graphs with a minimum degree condition (Q2401439) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles (Q6046228) (← links)
- Ramsey-Turán type results for matchings in edge colored graphs (Q6136669) (← links)
- Partitioning a 2-edge-coloured graph of minimum degree \(2n/3 + o(n)\) into three monochromatic cycles (Q6612514) (← links)
- Dynamic cycles in edge-colored multigraphs (Q6660053) (← links)
