Planar Graphs Have Exponentially Many 3-Arboricities

DOI10.1137/110846828zbMath1256.05056arXiv1110.4900MaRDI QIDQ4899062

Bojan Mohar, Ararat Harutyunyan

Publication date: 4 January 2013

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

planar graph; vertex-arboricity; digraph chromatic number

Mathematics Subject Classification ID

05C38: Paths and cycles

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs

05C20: Directed graphs (digraphs), tournaments