Pages that link to "Item:Q1125948"
From MaRDI portal
The following pages link to Partitioning by monochromatic trees (Q1125948):
Displaying 24 items.
- Vertex covers by monochromatic pieces -- a survey of results and problems (Q279224) (← links)
- Heterochromatic tree partition problem in complete tripartite graphs (Q409432) (← links)
- Partitioning random graphs into monochromatic components (Q510329) (← links)
- Partitioning complete graphs by heterochromatic trees (Q692699) (← links)
- Heterochromatic tree partition numbers for complete bipartite graphs (Q932639) (← links)
- Vertex partitions of \(r\)-edge-colored graphs (Q933003) (← links)
- Partitioning 3-edge-colored complete equi-bipartite graphs by monochromatic trees under a color degree condition (Q1010866) (← links)
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (Q1014813) (← links)
- Monochromatic trees with respect to edge partitions (Q1325267) (← links)
- Partitioning complete bipartite graphs by monochromatic cycles (Q1354726) (← links)
- Monochromatic trees in random graphs (Q1690004) (← links)
- Covering graphs by monochromatic trees and Helly-type results for hypergraphs (Q2043761) (← links)
- Generalizations and strengthenings of Ryser's conjecture (Q2121724) (← links)
- Monochromatic partitions in local edge colorings (Q2220970) (← links)
- Heterochromatic tree partition number in complete multipartite graphs (Q2251133) (← 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)
- The colour lemma. A combinatorial result and its application to tree partitions (Q2763619) (← links)
- The complexity for partitioning graphs by monochromatic trees, cycles and paths (Q4652867) (← links)
- Partitioning complete multipartite graphs by monochromatic trees (Q4667794) (← links)
- Covering 3-Edge-Colored Random Graphs with Monochromatic Trees (Q4997138) (← links)
- Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles (Q6046228) (← links)