id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
asir-2054	Zhang, Wenwen	List Edge Colorings of Planar Graphs with 7-cycles Containing at Most Two Chords	2019	7	.pdf	application/pdf	3479	243	87	For a vertex v ∈ V (G), we denote by fk (v) the number of k-faces incident with v. A graph is k-edge-colorable, if its edges can be colored with k colors such that adjacent edges receive different colors. Keywords List edge coloring, planar graph, cycle 1.	cache/asir-2054.pdf	txt/asir-2054.txt