Cycles in Color-Critical Graphs
Cycles in Color-Critical Graphs
复制标题
颜色关键图中的循环
DOI:
10.37236/10177
复制
发表时间:
2019-12
期刊:
影响因子:
--
通讯作者:
Douglas B. West
中科院分区:
文献类型:
--
作者:
Benjamin R. Moore;Douglas B. West
Tuza [1992] proved that a graph with no cycles of length congruent to $1$ modulo $k$ is $k$-colorable. We prove that if a graph $G$ has an edge $e$ such that $G-e$ is $k$-colorable and $G$ is not, then for $2le rle k$, the edge $e$ lies in at least $prod_{i=1}^{r-1} (k-i)$ cycles of length $1mod r$ in $G$, and $G-e$ contains at least $frac12{prod_{i=1}^{r-1} (k-i)}$ cycles of length $0 mod r$.0D;.A $(k,d)$-coloring of $G$ is a homomorphism from $G$ to the graph $K_{k:d}$ with vertex set ${mathbb Z}_{k}$ defined by making $i$ and $j$ adjacent if $dle j-i le k-d$. When $k$ and $d$ are relatively prime, define $s$ by $sdequiv 1mod k$. A result of Zhu [2002] implies that $G$ is $(k,d)$-colorable when $G$ has no cycle $C$ with length congruent to $is$ modulo $k$ for any $iin {1,ldots,2d-1}$. In fact, only $d$ classes need be excluded: we prove that if $G-e$ is $(k,d)$-colorable and $G$ is not, then $e$ lies in at least one cycle with length congruent to $ismod k$ for some $i$ in ${1,ldots,d}$. Furthermore, if this does not occur with $iin{1,ldots,d-1}$, then $e$ lies in at least two cycles with length $1mod k$ and $G-e$ contains a cycle of length $0 mod k$.
登录
查看更多内容
DOI:
10.1016/s0012-365x(00)00217-x
发表时间:
2001-02
期刊:
Discret. Math.
影响因子:
--
作者:
Xuding Zhu
通讯作者:
Xuding Zhu
影响因子:
1.1
作者:
A. Diwan;Sreyash Kenkre;S. Vishwanathan
通讯作者:
A. Diwan;Sreyash Kenkre;S. Vishwanathan
DOI:
10.1016/0012-365x(92)90609-j
发表时间:
1992-05
期刊:
Discret. Math.
影响因子:
--
作者:
Akira Saito
通讯作者:
Akira Saito
影响因子:
0.5
作者:
G. Minty
通讯作者:
G. Minty
DOI:
10.1137/20m1387882
发表时间:
2020-12
期刊:
SIAM J. Discret. Math.
影响因子:
--
作者:
Jun-ming Gao;Qingyi Huo;Jie Ma
通讯作者:
Jun-ming Gao;Qingyi Huo;Jie Ma