随机图的$f$-染色的分类 II

DOI10.11845/sxjz.2019102bOpenAlexW3208836436MaRDI QIDQ5037963

Yaping Xiong, Jian-Sheng Cai

Publication date: 29 September 2022

Full work available at URL: http://www.oaj.pku.edu.cn/sxjz/CN/10.11845/sxjz.2019102b

zbMATH Keywords

random graphLovász local lemma\(f\)-coloring

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Some sufficient conditions for a graph to be of \(C_f\) 1
• The classification of complete graphs \(K_n\) on \(f\)-coloring
• A generalization of edge-coloring in graphs
• Graph colouring and the probabilistic method

This page was built for publication: 随机图的$f$-染色的分类 II