On the game coloring index of \(F^+\)-decomposable graphs
From MaRDI portal
Publication:1693133
DOI10.1016/j.dam.2017.10.012zbMath1377.05114OpenAlexW4300849922MaRDI QIDQ1693133
Gabriela Paris, Brice Effantin, Clément Charpentier
Publication date: 11 January 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.10.012
2-person games (91A05) Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (1)
Cites Work
- Unnamed Item
- Decomposing a planar graph with girth at least 8 into a forest and a matching
- Decomposing a graph into forests
- A note on the game chromatic index of graphs
- Covering planar graphs with forests, one having bounded maximum degree
- The game coloring number of planar graphs
- Note on the game chromatic index of trees
- The incidence game chromatic number of \((a,d)\)-decomposable graphs
- The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\)
- Game chromatic index ofk-degenerate graphs
- ON THE COMPLEXITY OF SOME COLORING GAMES
- Decompositions of quadrangle-free planar graphs
- Decomposition of Finite Graphs Into Forests
This page was built for publication: On the game coloring index of \(F^+\)-decomposable graphs
