The following pages link to (Q3977492):
Displaying 32 items.
- Vertex covers by monochromatic pieces -- a survey of results and problems (Q279224) (← links)
- Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles (Q324825) (← links)
- Improved monochromatic loose cycle partitions in hypergraphs (Q396737) (← links)
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths (Q402591) (← links)
- Heterochromatic tree partition problem in complete tripartite graphs (Q409432) (← links)
- Monochromatic bounded degree subgraph partitions (Q501026) (← 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)
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (Q1014813) (← links)
- Vertex coverings by monochromatic cycles and trees (Q1174783) (← links)
- Vertex partitions by connected monochromatic \(k\)-regular graphs (Q1569063) (← links)
- Vertex covering with monochromatic pieces of few colours (Q1671656) (← links)
- Decompositions of edge-coloured infinite complete graphs into monochromatic paths. II (Q1678642) (← links)
- Erdős-Kakutani phenomena for paths (Q2036602) (← 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)
- Generalizations and strengthenings of Ryser's conjecture (Q2121724) (← links)
- Heterochromatic tree partition number in complete multipartite graphs (Q2251133) (← links)
- The Rado path decomposition theorem (Q2279931) (← links)
- Monochromatic infinite paths (Q2366010) (← links)
- Monochromatic cycle power partitions (Q2374161) (← links)
- Cover \(k\)-uniform hypergraphs by monochromatic loose paths (Q2411510) (← links)
- Partitioning 3-coloured complete graphs into three monochromatic paths (Q2857433) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Monochromatic coverings in colored complete graphs (Q3483311) (← links)
- (Q3838200) (← links)
- Monochromatic cycle covers in random graphs (Q4625023) (← links)
- Local colourings and monochromatic partitions in complete bipartite graphs (Q5890922) (← links)
- Local colourings and monochromatic partitions in complete bipartite graphs (Q5965537) (← links)
- Problems close to my heart (Q6116410) (← links)
