Pages that link to "Item:Q402591"

The following pages link to Partitioning edge-coloured complete graphs into monochromatic cycles and paths (Q402591):

Displaying 50 items.

• Vertex covers by monochromatic pieces -- a survey of results and problems (Q279224) (← links)
• Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles (Q324372) (← links)
• Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles (Q324825) (← links)
• Monochromatic cycle partitions of graphs with large minimum degree (Q345114) (← links)
• Improved monochromatic loose cycle partitions in hypergraphs (Q396737) (← links)
• Monochromatic loose-cycle partitions in hypergraphs (Q405239) (← links)
• Partitioning 2-edge-colored graphs by monochromatic paths and cycles (Q484546) (← links)
• The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles (Q497683) (← links)
• Monochromatic bounded degree subgraph partitions (Q501026) (← links)
• Partitioning random graphs into monochromatic components (Q510329) (← links)
• Partitioning 3-colored complete graphs into three monochromatic cycles (Q540032) (← links)
• Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\) (Q668072) (← links)
• Partitioning by monochromatic trees (Q1125948) (← links)
• Large monochromatic components and long monochromatic cycles in random hypergraphs (Q1633610) (← links)
• Vertex covering with monochromatic pieces of few colours (Q1671656) (← links)
• Decompositions of edge-coloured infinite complete graphs into monochromatic paths. II (Q1678642) (← links)
• Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles (Q1689909) (← links)
• Size-Ramsey numbers of cycles versus a path (Q1752689) (← links)
• Covering graphs by monochromatic trees and Helly-type results for hypergraphs (Q2043761) (← links)
• Monochromatic square-cycle and square-path partitions (Q2065889) (← links)
• Partitioning a graph into a cycle and a sparse graph (Q2092387) (← links)
• Towards Lehel's conjecture for 4-uniform tight cycles (Q2111790) (← links)
• Generalizations and strengthenings of Ryser's conjecture (Q2121724) (← links)
• Partitioning infinite hypergraphs into few monochromatic Berge-paths (Q2175777) (← links)
• Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths (Q2200044) (← links)
• Monochromatic partitions in local edge colorings (Q2220970) (← links)
• Minimum degree conditions for monochromatic cycle partitioning (Q2221921) (← links)
• The Rado path decomposition theorem (Q2279931) (← links)
• Long monochromatic paths and cycles in 2-edge-colored multipartite graphs (Q2299254) (← links)
• Monochromatic cycle power partitions (Q2374161) (← links)
• Decompositions of edge-colored infinite complete graphs into monochromatic paths (Q2397547) (← links)
• Monochromatic loose path partitions in \(k\)-uniform hypergraphs (Q2404368) (← links)
• Monochromatic paths in 2-edge-coloured graphs and hypergraphs (Q2699642) (← links)
• Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles (Q2800590) (← links)
• Partitioning 3-coloured complete graphs into three monochromatic paths (Q2857433) (← links)
• Calculating Ramsey Numbers by Partitioning Colored Graphs (Q2978186) (← links)
• Monochromatic cycle partitions of edge-colored graphs (Q3067062) (← links)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
• One-sided coverings of colored complete bipartite graphs (Q3424878) (← links)
• Monochromatic Cycle Partitions in Local Edge Colorings (Q3466360) (← links)
• Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles (Q4238172) (← links)
• Perfect matchings and Hamiltonian cycles in the preferential attachment model (Q4633318) (← 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)
• On some Multicolor Ramsey Properties of Random Graphs (Q5357963) (← links)
• An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths (Q5364242) (← links)
• Path Ramsey Number for Random Graphs (Q5366907) (← links)
• Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles (Q5854893) (← links)
• Local colourings and monochromatic partitions in complete bipartite graphs (Q5965537) (← links)