Heterochromatic tree partition problem in complete tripartite graphs
From MaRDI portal
(Redirected from Publication:409432)
Recommendations
- Heterochromatic tree partition numbers for complete bipartite graphs
- Heterochromatic tree partition number in complete multipartite graphs
- Partitioning complete graphs by heterochromatic trees
- Monochromatic tree partition for complete multipartite graphs
- Partitioning 3-edge-colored complete equi-bipartite graphs by monochromatic trees under a color degree condition
Cites work
- scientific article; zbMATH DE number 15152 (Why is no real title available?)
- An improved bound for the monochromatic cycle partition number
- Heterochromatic tree partition numbers for complete bipartite graphs
- Highly connected monochromatic subgraphs
- Monochromatic Paths in Graphs
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- On the minimum monochromatic or multicolored subgraph partition problems
- Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees
- Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
- Partitioning by monochromatic trees
- Partitioning complete bipartite graphs by monochromatic cycles
- Partitioning complete graphs by heterochromatic trees
- Partitioning complete multipartite graphs by monochromatic trees
- Vertex coverings by monochromatic cycles and trees
- Vertex coverings by monochromatic paths and cycles
Cited in
(6)- Partitioning complete graphs by heterochromatic trees
- Heterochromatic tree partition numbers for complete bipartite graphs
- Heterochromatic tree partition number in complete multipartite graphs
- Monochromatic tree partition for complete multipartite graphs
- scientific article; zbMATH DE number 1536521 (Why is no real title available?)
- Partitioning complete multipartite graphs by monochromatic trees
This page was built for publication: Heterochromatic tree partition problem in complete tripartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409432)