Heterochromatic tree partition problem in complete tripartite graphs
From MaRDI portal
Publication:409432
DOI10.1016/J.DISC.2011.11.005zbMATH Open1238.05212OpenAlexW2051226103MaRDI QIDQ409432FDOQ409432
Authors: Shili Wen, Shujun Zhou, Zemin Jin 
Publication date: 13 April 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.11.005
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
Trees (05C05) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- An improved bound for the monochromatic cycle partition number
- Heterochromatic tree partition numbers for complete bipartite graphs
- Partitioning by monochromatic trees
- Vertex coverings by monochromatic cycles and trees
- Partitioning complete bipartite graphs by monochromatic cycles
- Title not available (Why is that?)
- Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
- Vertex coverings by monochromatic paths and cycles
- On the minimum monochromatic or multicolored subgraph partition problems
- Highly connected monochromatic subgraphs
- Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees
- Monochromatic Paths in Graphs
- Partitioning complete multipartite graphs by monochromatic trees
- Partitioning complete graphs by heterochromatic trees
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
- Title not available (Why is that?)
- 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)
