Equitable list point arboricity of graphs

DOI10.2298/FIL1602373ZzbMath1462.05152arXiv1403.2809MaRDI QIDQ5279301

Xin Zhang

Publication date: 19 July 2017

Published in: Filomat (Search for Journal in Brave)

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

zbMATH Keywords

planar graphlist coloringequitable coloringpoint arboricity

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Equitable d-degenerate Choosability of Graphs ⋮ On Equitable List Arboricity of Graphs ⋮ Equitable list vertex colourability and arboricity of grids ⋮ Equitable improper choosability of graphs ⋮ Equitable list tree-coloring of bounded treewidth graphs ⋮ Equitable vertex arboricity conjecture holds for graphs with low degeneracy ⋮ Theoretical aspects of equitable partition of networks into sparse modules ⋮ Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy

This page was built for publication: Equitable list point arboricity of graphs