Pages that link to "Item:Q1174783"
From MaRDI portal
The following pages link to Vertex coverings by monochromatic cycles and trees (Q1174783):
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)
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths (Q402591) (← links)
- A note on covering edge colored hypergraphs by monochromatic components (Q405234) (← 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)
- Vertex partitions of \(r\)-edge-colored graphs (Q933003) (← 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)
- Partitioning complete bipartite graphs by monochromatic cycles (Q1354726) (← 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)
- Lower bounds on the number of monochromatic matchings in \(K_{2s+t-1}\) (Q1684931) (← links)
- Exponentially many monochromatic \(n\)-matchings in \(K_{3n-1}\) (Q1926046) (← links)
- Covering graphs by monochromatic trees and Helly-type results for hypergraphs (Q2043761) (← links)
- Turán density of 2-edge-colored bipartite graphs with application on \(\{2, 3\}\)-hypergraphs (Q2049617) (← 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)
- Dirac-type theorems in random hypergraphs (Q2131868) (← 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)
- A proof of Ringel's conjecture (Q2232153) (← links)
- Heterochromatic tree partition number in complete multipartite graphs (Q2251133) (← links)
- Monochromatic cycle power partitions (Q2374161) (← links)
- Decompositions of edge-colored infinite complete graphs into monochromatic paths (Q2397547) (← links)
- Covering complete partite hypergraphs by monochromatic components (Q2404363) (← links)
- Monochromatic tree covers and Ramsey numbers for set-coloured graphs (Q2411628) (← links)
- On the minimum monochromatic or multicolored subgraph partition problems (Q2456352) (← links)
- Highly connected monochromatic subgraphs (Q2477397) (← links)
- Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees (Q2479574) (← links)
- Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles (Q2800590) (← links)
- (Q2857433) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Packing the Boolean lattice with copies of a poset (Q3296748) (← links)
