Pages that link to "Item:Q484546"
From MaRDI portal
The following pages link to Partitioning 2-edge-colored graphs by monochromatic paths and cycles (Q484546):
Displaying 29 items.
- Ramsey number of paths and connected matchings in Ore-type host graphs (Q267181) (← links)
- Growth rates of groups associated with face 2-coloured triangulations and directed Eulerian digraphs on the sphere (Q278890) (← links)
- Vertex covers by monochromatic pieces -- a survey of results and problems (Q279224) (← links)
- Monochromatic cycle partitions of graphs with large minimum degree (Q345114) (← links)
- Improved monochromatic loose cycle partitions in hypergraphs (Q396737) (← links)
- Triangulations of the sphere, bitrades and abelian groups (Q484547) (← links)
- Monochromatic bounded degree subgraph partitions (Q501026) (← links)
- Shortcutting directed and undirected networks with a degree constraint (Q507583) (← links)
- Partitioning random graphs into monochromatic components (Q510329) (← links)
- Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\) (Q668072) (← links)
- Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5 (Q1306426) (← links)
- Vertex covering with monochromatic pieces of few colours (Q1671656) (← links)
- Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles (Q1689909) (← links)
- Monochromatic square-cycle and square-path partitions (Q2065889) (← links)
- Partitioning a graph into a cycle and a sparse graph (Q2092387) (← links)
- Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths (Q2200044) (← 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)
- Stability for vertex cycle covers (Q2401441) (← links)
- Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles (Q2800590) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- The complexity for partitioning graphs by monochromatic trees, cycles and paths (Q4652867) (← links)
- Monochromatic cycle partitions in random graphs (Q4993124) (← links)
- Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles (Q5270411) (← 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)
- Partitioning a 2-edge-coloured graph of minimum degree \(2n/3 + o(n)\) into three monochromatic cycles (Q6612514) (← links)
- Large monochromatic components in expansive hypergraphs (Q6632815) (← links)
