Equitable Coloring and Equitable Choosability of Planar Graphs without chordal 4- and 6-Cycles

DOI10.23638/DMTCS-21-3-16zbMath1430.05035arXiv1806.01064MaRDI QIDQ5208462

Aijun Dong, Jian Liang Wu

Publication date: 15 January 2020

Full work available at URL: https://arxiv.org/abs/1806.01064

zbMATH Keywords

planar graphdischargingequitable choosability

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

On Equitable List Arboricity of Graphs ⋮ A note on the equitable choosability of complete bipartite graphs ⋮ On list equitable total colorings of the generalized theta graph

This page was built for publication: Equitable Coloring and Equitable Choosability of Planar Graphs without chordal 4- and 6-Cycles