Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles

Shu, QJ; Chen, Y; Han, SG; Lin, GH; Miyano, E; Zhang, A

Lin, GH (corresponding author), Univ Alberta, Dept Comp Sci, Edmonton, AB T6G 2E8, Canada.

THEORETICAL COMPUTER SCIENCE, 2021; 882 (): 77

Abstract

An acyclic edge coloring of a graph G is a proper edge coloring such that no bichromatic cycles are produced. The acyclic edge coloring conjecture by ......

Full Text Link


Links

期刊讨论 | 中国SCI论文 | 期刊主页 | 投稿经验 | 杂志官网 | 投稿链接 | 作者需知 | PMC链接 | Pubmed全文检索