umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Restricted extension of sparse partial edge colorings of hypercubes
Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.
Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.
(English)Manuscript (preprint) (Other academic)
Abstract [en]

We consider the following type of question: Given a partial proper d-edge coloring of the d-dimensional hypercube Qd, and lists of allowed colors for the non-colored edges of Qd, can we extend the partial coloring to a proper d-edge coloring using only colors from the lists? We prove that this question has a positive answer in the case when both the partial coloring and the color lists satisfy certain sparsity conditions.

National Category
Discrete Mathematics
Research subject
Mathematics
Identifiers
URN: urn:nbn:se:umu:diva-146922OAI: oai:DiVA.org:umu-146922DiVA, id: diva2:1203747
Available from: 2018-05-04 Created: 2018-05-04 Last updated: 2019-04-29
In thesis
1. On avoiding and completing edge colorings
Open this publication in new window or tab >>On avoiding and completing edge colorings
2018 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

These papers are all related to the problem of avoiding and completing an edge precoloring of a graph. In more detail, given a graph G and a partial proper edge precoloring φ of G and a list assignment L for every non-colored edge of G, can we extend the precoloring to a proper edge coloring avoiding any list assignment? In the first paper, G is a d-dimensional hypercube graph Qd, a partial proper edge precoloring φ and every list assignment L must satisfy certain sparsity conditions. The second paper still deals with d-dimensional hypercube graph Qd, but the list assignment L for every edge of Qd is an empty set and φ must be a partial proper edge precoloring of at most (d - 1) edges. For the third paper, G can be seen as a complete 3-uniform 3-partite hypergraph, every list assignment L must satisfy certain sparsity conditions but we do not have a partial proper edge precoloring φ on edges of G. 

Place, publisher, year, edition, pages
Umeå: Umeå University, 2018. p. 8
Series
Research report in mathematics, ISSN 1653-0810
National Category
Discrete Mathematics
Research subject
Mathematics
Identifiers
urn:nbn:se:umu:diva-146915 (URN)978-91-7601-876-7 (ISBN)
Presentation
2018-05-17, MA346, MIT Building, Umea University, Umea, 13:00 (English)
Opponent
Supervisors
Available from: 2018-05-25 Created: 2018-05-04 Last updated: 2018-06-09Bibliographically approved
2. On avoiding and completing colorings
Open this publication in new window or tab >>On avoiding and completing colorings
2019 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

All of my papers are related to the problem of avoiding and completing an edge precoloring of a graph. In more detail, given a graph G and a partial proper edge precoloring φ of G and a list assignment L for every non-colored edge of G, can we extend φ to a proper edge coloring of G which avoids L? 

In Paper I, G is the d-dimensional hypercube graph Qd, a partial proper edge precoloring φ and a list assignment L must satisfy certain sparsity conditions. Paper II still deals with the hypercube graph Qd, but the list assignment L for every edge of Qd is an empty set and φ must be a partial proper edge precoloring of at most d-1 edges. In Paper III, G is a (d,s)-edge colorable graph; that is G has a proper d-edge coloring, where every edge is contained in at least s-1 2-colored 4-cycles, L must satisfy certain sparsity conditions and we do not have a partial proper edge precoloring φ on edges of G. The problem in Paper III is also considered in Paper IV and Paper V, but here G can be seen as the complete 3-uniform 3-partite hypergraph K3n,n,n, where n is a power of two in paper IV and n is an even number in paper V.

Place, publisher, year, edition, pages
Umeå: Umeå University, 2019. p. 11
Series
Research report in mathematics, ISSN 1653-0810 ; 66/19
Keywords
Graph coloring, precoloring, list assignment
National Category
Discrete Mathematics
Identifiers
urn:nbn:se:umu:diva-158343 (URN)978-91-7855-055-5 (ISBN)
Public defence
2019-05-24, MA121, MIT-huset, Umeå, 10:15 (English)
Opponent
Supervisors
Available from: 2019-05-03 Created: 2019-04-24 Last updated: 2019-04-29Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

URL

Authority records BETA

Markström, KlasPham, Lan Anh

Search in DiVA

By author/editor
Markström, KlasPham, Lan Anh
By organisation
Department of Mathematics and Mathematical Statistics
Discrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 109 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf