Pages that link to "Item:Q484546"

The following pages link to Partitioning 2-edge-colored graphs by monochromatic paths and cycles (Q484546):

Displaying 7 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)
• Monochromatic cycle partitions of graphs with large minimum degree (Q345114) (← links)
• Improved monochromatic loose cycle partitions in hypergraphs (Q396737) (← links)
• Monochromatic bounded degree subgraph partitions (Q501026) (← links)
• Shortcutting directed and undirected networks with a degree constraint (Q507583) (← links)
• Local colourings and monochromatic partitions in complete bipartite graphs (Q5965537) (← links)