Incidence Coloring Game and Arboricity of Graphs

DOI10.1007/978-3-642-45278-9_10zbMath1408.05060arXiv1304.0166OpenAlexW1586698801MaRDI QIDQ2870020

Clément Charpentier, Eric Sopena

Publication date: 17 January 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

arboricityincidence coloringincidence game chromatic numberincidence coloring game

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (2)

The incidence game chromatic number of \((a,d)\)-decomposable graphs ⋮ On game chromatic vertex-critical graphs

This page was built for publication: Incidence Coloring Game and Arboricity of Graphs