Equitable list point arboricity of graphs

DOI10.2298/FIL1602373ZMaRDI QIDQ5279301zbMATH OpenFDO

Authors 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

equitable coloringlist coloringplanar graphpoint arboricity

Mathematics Subject Classification ID

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

Abstract: A graph $G$ is list point $k$-arborable if, whenever we are given a $k$-list assignment $L(v)$ of colors for each vertex $vinV(G)$, we can choose a color $c(v)inL(v)$ for each vertex $v$ so that each color class induces an acyclic subgraph of $G$, and is equitable list point $k$-arborable if $G$ is list point $k$-arborable and each color appears on at most $lceil|V(G)|/kceil$ vertices of $G$. In this paper, we conjecture that every graph $G$ is equitable list point $k$-arborable for every $kgeqlceil(Delta(G)+1)/2ceil$ and settle this for complete graphs, 2-degenerate graphs, 3-degenerate claw-free graphs with maximum degree at least 4, and planar graphs with maximum degree at least 8.

Recommendations

• On equitable list arboricity of graphs
• List point arboricity of graphs
• Equitable vertex arboricity of graphs
• On the equitable vertex arboricity of graphs
• List point arboricity of dense graphs
• Equitable list vertex colourability and arboricity of grids
• Equitable vertex arboricity of planar graphs
• A conjecture on equitable vertex arboricity of graphs
• scientific article; zbMATH DE number 1135686
• The list point arboricity of some complete multi-partite graphs.

Cited in

(12)

• List point arboricity of dense graphs
• Theoretical aspects of equitable partition of networks into sparse modules
• Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy
• Equitable improper choosability of graphs
• Equitable list tree-coloring of bounded treewidth graphs
• Equitable vertex arboricity conjecture holds for graphs with low degeneracy
• The list point arboricity of some complete multi-partite graphs.
• List point arboricity of graphs
• On equitable list arboricity of graphs
• Equitable d-degenerate Choosability of Graphs
• Equitable list vertex colourability and arboricity of grids
• Equitable vertex arboricity of graphs with low maximum degree

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5279301)