Bibliographic Details
| Title: |
Extending edge-colorings of distance-2 matchings in the hypercube. |
| Authors: |
Bärnkopf, Pál1 (AUTHOR) barpal@student.elte.hu |
| Source: |
Discrete Applied Mathematics. Jul2026, Vol. 387, p33-36. 4p. |
| Subjects: |
Hypercubes, Graph coloring, Bipartite graphs, Graph theory, Matching theory |
| Abstract: |
Casselgren, Markstörm, and Pham conjectured that any precolored distance-2 matching in the d -dimensional cube Q d with at most d colors can be extended to a proper d -edge-coloring. In this paper, we prove this conjecture and some related theorems. Especially, our result establishes that if G is a bipartite graph, then a precolored distance-2 matching in the Cartesian product H = G □ K 2 m with at most χ ′ (H) = Δ (H) = Δ (G) + 2 m − 1 colors can be extended to an edge-coloring using at most χ ′ (H) colors. As another generalization, we establish a similar result for the Cartesian product G □ K 1 , m . [ABSTRACT FROM AUTHOR] |
|
Copyright of Discrete Applied Mathematics is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
