Equitable Coloring of Graphs with Intermediate Maximum Degree
摘要：
If the vertices of a graph $G$ are colored with $k$ colors such that no adjacent vertices receive the same color and the sizes of any two color classes differ by at most one, then $G$ is said to be equitably $k$-colorable. Let $|G|$ denote the number of vertices of $G$ and $\\Delta=\\Delta(G)$ the maximum degree of a vertex in $G$. We prove that a graph $G$ of order at least 6 is equitably $\\Delta$-colorable if $G$ satisfies $(|G|+1)/3 \\leq \\Delta < |G|/2$ and none of its components is a $K_{\\Delta +1}$.
展开
DOI：
10.48550/arXiv.1408.6046
被引量：
年份：
2014
arXiv.org
(全网免费下载)
ResearchGate
(全网免费下载)
Citeseer
(全网免费下载)
钛学术
(全网免费下载)
core.ac.uk
(全网免费下载)
学术范
(全网免费下载)
通过文献互助平台发起求助，成功后即可免费获取论文全文。
请先登入
相似文献
参考文献
引证文献
辅助模式
0
引用
文献可以批量引用啦~
欢迎点我试用！
