Pages that link to "Item:Q859613"

The following pages link to An improved bound for the monochromatic cycle partition number (Q859613):

Displaying 48 items.

• Ramsey number of paths and connected matchings in Ore-type host graphs (Q267181) (← links)
• 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)
• 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)
• 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 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)
• Covering graphs by monochromatic trees and Helly-type results for hypergraphs (Q2043761) (← links)
• Monochromatic square-cycle and square-path partitions (Q2065889) (← 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)
• Matchings with few colors in colored complete graphs and hypergraphs (Q2305937) (← links)
• Monochromatic cycle power partitions (Q2374161) (← links)
• A note on the saturation number of the family of \(k\)-connected graphs (Q2439131) (← links)
• Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs (Q2477627) (← links)
• Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles (Q2800590) (← links)
• Ramsey Number of a Connected Triangle Matching (Q2825485) (← links)
• (Q2857433) (← links)
• The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle (Q3068812) (← 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 (Q5890922) (← 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)
• Problems close to my heart (Q6116410) (← links)
• Partitioning a 2-edge-coloured graph of minimum degree \(2n/3 + o(n)\) into three monochromatic cycles (Q6612514) (← links)
• Tiling edge-coloured graphs with few monochromatic bounded-degree graphs (Q6621182) (← links)