Pages that link to "Item:Q4238172"

The following pages link to Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles (Q4238172):

Displaying 44 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)
• Partitioning edge-coloured complete graphs into monochromatic cycles and paths (Q402591) (← links)
• Monochromatic loose-cycle partitions in hypergraphs (Q405239) (← links)
• Heterochromatic tree partition problem in complete tripartite graphs (Q409432) (← links)
• Partitioning 2-edge-colored graphs by monochromatic paths and cycles (Q484546) (← links)
• Coverings by few monochromatic pieces: a transition between two Ramsey problems (Q489351) (← links)
• Monochromatic bounded degree subgraph partitions (Q501026) (← links)
• Partitioning random graphs into monochromatic components (Q510329) (← links)
• Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs (Q641170) (← links)
• Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\) (Q668072) (← links)
• Partitioning complete graphs by heterochromatic trees (Q692699) (← links)
• An improved bound for the monochromatic cycle partition number (Q859613) (← links)
• Heterochromatic tree partition numbers for complete bipartite graphs (Q932639) (← links)
• Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture (Q965246) (← links)
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (Q1014813) (← links)
• Vertex partitions by connected monochromatic \(k\)-regular graphs (Q1569063) (← 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)
• Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles (Q1750222) (← 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)
• Partitioning infinite hypergraphs into few monochromatic Berge-paths (Q2175777) (← links)
• Monochromatic partitions in local edge colorings (Q2220970) (← links)
• Minimum degree conditions for monochromatic cycle partitioning (Q2221921) (← links)
• Heterochromatic tree partition number in complete multipartite graphs (Q2251133) (← links)
• Monochromatic cycle power partitions (Q2374161) (← links)
• Cover \(k\)-uniform hypergraphs by monochromatic loose paths (Q2411510) (← links)
• Monochromatic paths in 2-edge-coloured graphs and hypergraphs (Q2699642) (← links)
• Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles (Q2800590) (← links)
• (Q2857433) (← links)
• Monochromatic cycle partitions of edge-colored graphs (Q3067062) (← links)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
• Monochromatic Cycle Partitions in Local Edge Colorings (Q3466360) (← links)
• Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles (Q3527536) (← links)
• An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs (Q4920655) (← links)
• Monochromatic cycle partitions in random graphs (Q4993124) (← links)
• Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles (Q5270411) (← links)
• Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles (Q5854893) (← links)
• Local colourings and monochromatic partitions in complete bipartite graphs (Q5965537) (← links)