Pages that link to "Item:Q345114"
From MaRDI portal
The following pages link to Monochromatic cycle partitions of graphs with large minimum degree (Q345114):
Displaying 20 items.
- Vertex covers by monochromatic pieces -- a survey of results and problems (Q279224) (← links)
- Improved monochromatic loose cycle partitions in hypergraphs (Q396737) (← links)
- Best monotone degree conditions for binding number and cycle structure (Q496429) (← links)
- Partitioning random graphs into monochromatic components (Q510329) (← links)
- Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\) (Q668072) (← links)
- Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture (Q965246) (← links)
- Vertex covering with monochromatic pieces of few colours (Q1671656) (← links)
- Monochromatic square-cycle and square-path partitions (Q2065889) (← links)
- Partitioning a graph into a cycle and a sparse graph (Q2092387) (← links)
- Minimum degree conditions for monochromatic cycle partitioning (Q2221921) (← links)
- Large monochromatic components in edge colored graphs with a minimum degree condition (Q2401439) (← links)
- Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles (Q2800590) (← links)
- Monochromatic cycles in 2-coloured graphs (Q2883852) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Monochromatic cycle partitions in random graphs (Q4993124) (← links)
- Spanning Trees with Few Branch Vertices (Q5232165) (← links)
- Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles (Q5270411) (← links)
- Cycle partitions of regular graphs (Q5886097) (← links)
- Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles (Q6046228) (← links)
- Partitioning a 2-edge-coloured graph of minimum degree \(2n/3 + o(n)\) into three monochromatic cycles (Q6612514) (← links)
