Partitioning 3-edge-colored complete equi-bipartite graphs by monochromatic trees under a color degree condition.
Li, Xueliang ; Liu, Fengxia
The Electronic Journal of Combinatorics [electronic only], Tome 15 (2008), / Harvested from The Electronic Library of Mathematics
Publié le : 2008-01-01
EUDML-ID : urn:eudml:doc:130280
@article{05541036,
     title = {Partitioning 3-edge-colored complete equi-bipartite graphs by monochromatic trees under a color degree condition.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {15},
     year = {2008},
     zbl = {1165.05319},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05541036}
}
Li, Xueliang; Liu, Fengxia. Partitioning 3-edge-colored complete equi-bipartite graphs by monochromatic trees under a color degree condition.. The Electronic Journal of Combinatorics [electronic only], Tome 15 (2008) . http://gdmltest.u-ga.fr/item/05541036/