id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-5942	Sittitrai, Pongpat; Nakprasit, Kittikorn; Jumnongnit, Patcharapan	The Total Choosability with Neighbor Sum Distinguishing Properties of Planar Graphs That Are Devoid of \(C_5\) Adjacent to \(C_3\)	2025	7	.pdf	application/pdf	3298	229	80	[7] confirmed the conjecture by planar graphs without 3-cycles with maximum degree at least 7 and planar graphs without 5-cycles with maximum degree at least 7, respectively. Conjecture 1 has been verified for several classes of planar graphs as follows: planar graphs without adjacent 3-cycles with maximum degree at least 8 by [12], planar graphs without adjacent 6-cycles with maximum degree at least 7 [13], and planar graphs without 4-cycles adjacent to 3-cycles with maximum degree at least 7 by [14].	cache/ejpam-5942.pdf	txt/ejpam-5942.txt