Edge Kempe equivalence of regular graph covers

Nir Lazarovich; Arie Levit

doi:https://doi.org/10.1002/jgt.22500

Edge Kempe equivalence of regular graph covers

Nir Lazarovich, Arie Levit

Mathematics

Technion - Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

Abstract

Let G be a finite d -regular graph with a proper edge coloring. An edge Kempe switch is a new proper edge coloring of G obtained by switching the two colors along some bichromatic cycle. We prove that any other edge coloring can be obtained by performing finitely many edge Kempe switches, provided that G is replaced with a suitable finite covering graph. The required covering degree is bounded above by a constant depending only on d.

Original language	English
Pages (from-to)	553-559
Number of pages	7
Journal	Journal of Graph Theory
Volume	93
Issue number	4
DOIs	https://doi.org/10.1002/jgt.22500
State	Published - 1 Apr 2020

Keywords

edge Kempe moves
graph coloring
graph covers
uniform tree lattices

All Science Journal Classification (ASJC) codes

Geometry and Topology
Discrete Mathematics and Combinatorics

Access to Document

https://doi.org/10.1002/jgt.22500

Cite this

@article{add286d4a36a4d48ab50b4b4e68a50bf,

title = "Edge Kempe equivalence of regular graph covers",

abstract = "Let G be a finite d -regular graph with a proper edge coloring. An edge Kempe switch is a new proper edge coloring of G obtained by switching the two colors along some bichromatic cycle. We prove that any other edge coloring can be obtained by performing finitely many edge Kempe switches, provided that G is replaced with a suitable finite covering graph. The required covering degree is bounded above by a constant depending only on d.",

keywords = "edge Kempe moves, graph coloring, graph covers, uniform tree lattices",

author = "Nir Lazarovich and Arie Levit",

note = "Publisher Copyright: {\textcopyright} 2019 Wiley Periodicals, Inc.",

year = "2020",

month = apr,

day = "1",

doi = "https://doi.org/10.1002/jgt.22500",

language = "الإنجليزيّة",

volume = "93",

pages = "553--559",

journal = "Journal of Graph Theory",

issn = "0364-9024",

publisher = "Wiley-Liss Inc.",

number = "4",

}

TY - JOUR

T1 - Edge Kempe equivalence of regular graph covers

AU - Lazarovich, Nir

AU - Levit, Arie

PY - 2020/4/1

Y1 - 2020/4/1

N2 - Let G be a finite d -regular graph with a proper edge coloring. An edge Kempe switch is a new proper edge coloring of G obtained by switching the two colors along some bichromatic cycle. We prove that any other edge coloring can be obtained by performing finitely many edge Kempe switches, provided that G is replaced with a suitable finite covering graph. The required covering degree is bounded above by a constant depending only on d.

AB - Let G be a finite d -regular graph with a proper edge coloring. An edge Kempe switch is a new proper edge coloring of G obtained by switching the two colors along some bichromatic cycle. We prove that any other edge coloring can be obtained by performing finitely many edge Kempe switches, provided that G is replaced with a suitable finite covering graph. The required covering degree is bounded above by a constant depending only on d.

KW - edge Kempe moves

KW - graph coloring

KW - graph covers

KW - uniform tree lattices

UR - http://www.scopus.com/inward/record.url?scp=85073980194&partnerID=8YFLogxK

U2 - https://doi.org/10.1002/jgt.22500

DO - https://doi.org/10.1002/jgt.22500

M3 - مقالة

SN - 0364-9024

VL - 93

SP - 553

EP - 559

JO - Journal of Graph Theory

JF - Journal of Graph Theory

IS - 4

ER -

Edge Kempe equivalence of regular graph covers

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this