Minimum rainbow H-decompositions of graphs. (June 2018)
- Record Type:
- Journal Article
- Title:
- Minimum rainbow H-decompositions of graphs. (June 2018)
- Main Title:
- Minimum rainbow H-decompositions of graphs
- Authors:
- Özkahya, Lale
Person, Yury - Abstract:
- Abstract: Given graphs G and H, we consider the problem of decomposing a properly edge-colored graph G into few parts consisting of rainbow copies of H and single edges. We establish a close relation to the previously studied problem of minimum H -decompositions, where an edge coloring does not matter and one is merely interested in decomposing graphs into copies of H and single edges.
- Is Part Of:
- European journal of combinatorics. Volume 71(2018)
- Journal:
- European journal of combinatorics
- Issue:
- Volume 71(2018)
- Issue Display:
- Volume 71, Issue 2018 (2018)
- Year:
- 2018
- Volume:
- 71
- Issue:
- 2018
- Issue Sort Value:
- 2018-0071-2018-0000
- Page Start:
- 111
- Page End:
- 124
- Publication Date:
- 2018-06
- Subjects:
- Combinatorial analysis -- Periodicals
Analyse combinatoire -- Périodiques
Combinatorial analysis
Periodicals
Electronic journals
511.6 - Journal URLs:
- http://www.sciencedirect.com/science/journal/01956698 ↗
http://www.elsevier.com/journals ↗
http://www.idealibrary.com ↗
http://firstsearch.oclc.org ↗
http://firstsearch.oclc.org/journal=0195-6698;screen=info;ECOIP ↗ - DOI:
- 10.1016/j.ejc.2018.03.002 ↗
- Languages:
- English
- ISSNs:
- 0195-6698
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 3829.728200
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 6518.xml