Partitioning complete multipartite graphs by monochromatic trees
From MaRDI portal
Recommendations
- Monochromatic tree partition for complete multipartite graphs
- Partitioning 3-edge-colored complete equi-bipartite graphs by monochromatic trees under a color degree condition
- Heterochromatic tree partition number in complete multipartite graphs
- Partitioning by monochromatic trees
- Heterochromatic tree partition numbers for complete bipartite graphs
- Constructing trees in bipartite graphs
- scientific article; zbMATH DE number 3871407
- Heterochromatic tree partition problem in complete tripartite graphs
- Partitioning complete graphs by heterochromatic trees
- Vertex partitions of \(r\)-edge-colored graphs
Cited in
(20)- Partitioning 3-edge-colored complete equi-bipartite graphs by monochromatic trees under a color degree condition
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Partitioning by monochromatic trees
- Monochromatic coverings and tree Ramsey numbers
- Monochromatic homeomorphically irreducible trees in 2-edge-colored complete graphs
- Constructing trees in bipartite graphs
- Heterochromatic tree partition number in complete multipartite graphs
- Monochromatic tree covers and Ramsey numbers for set-coloured graphs
- On the minimum monochromatic or multicolored subgraph partition problems
- Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees
- Monochromatic tree partition for complete multipartite graphs
- scientific article; zbMATH DE number 4041942 (Why is no real title available?)
- Heterochromatic tree partition problem in complete tripartite graphs
- scientific article; zbMATH DE number 2014472 (Why is no real title available?)
- The complexity for partitioning graphs by monochromatic trees, cycles and paths
- Multiplicity of stars in complete graphs and complete r-partite graphs.
- Multicolored forests in complete bipartite graphs
- Partitioning complete graphs by heterochromatic trees
- Heterochromatic tree partition numbers for complete bipartite graphs
- Vertex partitions of \(r\)-edge-colored graphs
This page was built for publication: Partitioning complete multipartite graphs by monochromatic trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4667794)