Partitioning complete graphs by heterochromatic trees (Q692699)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Partitioning complete graphs by heterochromatic trees	scientific article

Statements

scholarly article

Partitioning complete graphs by heterochromatic trees (English)

Acta Mathematicae Applicatae Sinica. English Series

publication date

6 December 2012

full work available at URL

https://arxiv.org/abs/0711.2849

zbMATH Keywords

edge-colored graph

heterochromatic tree

partition

MaRDI profile type

MaRDI publication profile

Heterochromatic tree partition numbers for complete bipartite graphs

Vertex coverings by monochromatic cycles and trees

Vertex coverings by monochromatic paths and cycles

An improved bound for the monochromatic cycle partition number

Partitioning complete bipartite graphs by monochromatic cycles

Partitioning by monochromatic trees

Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees

Partitioning complete multipartite graphs by monochromatic trees

On the minimum monochromatic or multicolored subgraph partition problems

Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles

Monochromatic Paths in Graphs

Identifiers

Sitelinks

Mathematics(1 entry)

mardi Publication:692699

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q692699&oldid=38446902"