当前位置:
X-MOL 学术
›
J. Comb. Theory B
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Reconfiguring colorings of graphs with bounded maximum average degree
Journal of Combinatorial Theory Series B ( IF 1.2 ) Pub Date : 2020-11-12 , DOI: 10.1016/j.jctb.2020.11.001 Carl Feghali
中文翻译:
用有界最大平均度重新配置图的颜色
更新日期:2020-11-12
Journal of Combinatorial Theory Series B ( IF 1.2 ) Pub Date : 2020-11-12 , DOI: 10.1016/j.jctb.2020.11.001 Carl Feghali
The reconfiguration graph for the k-colorings of a graph G has as vertex set the set of all possible k-colorings of G and two colorings are adjacent if they differ in the color of exactly one vertex of G. Let be integers such that . We prove that for every and every graph G with n vertices and maximum average degree , has diameter . This significantly strengthens several existing results.
中文翻译:
用有界最大平均度重新配置图的颜色
重新配置图 用于ķ的曲线图的-colorings ģ具有作为顶点设定的设定的所有可能的ķ的-colorings ģ和两个着色剂,如果他们在恰好一个顶点的颜色不同相邻ģ。让 是这样的整数 。我们证明每个图G都有n个顶点和最大平均度, 有直径 。这大大加强了几个现有的结果。