Pages that link to "Item:Q3067062"
From MaRDI portal
The following pages link to Monochromatic cycle partitions of edge-colored graphs (Q3067062):
Displayed 16 items.
- Vertex covers by monochromatic pieces -- a survey of results and problems (Q279224) (← links)
- Improved monochromatic loose cycle partitions in hypergraphs (Q396737) (← links)
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths (Q402591) (← links)
- Monochromatic loose-cycle partitions in hypergraphs (Q405239) (← links)
- Partitioning 2-edge-colored graphs by monochromatic paths and cycles (Q484546) (← links)
- Monochromatic bounded degree subgraph partitions (Q501026) (← links)
- Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs (Q641170) (← links)
- Vertex covering with monochromatic pieces of few colours (Q1671656) (← links)
- Monochromatic square-cycle and square-path partitions (Q2065889) (← links)
- Minimum degree conditions for monochromatic cycle partitioning (Q2221921) (← links)
- Monochromatic cycle power partitions (Q2374161) (← links)
- Large monochromatic components in edge colored graphs with a minimum degree condition (Q2401439) (← links)
- Monochromatic cycle partitions in random graphs (Q4993124) (← links)
- Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles (Q5854893) (← 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)