The incidence game chromatic number of (a,d)-decomposable graphs

DOI10.1016/J.JDA.2014.10.001zbMATH Open1325.05074OpenAlexW1978265445MaRDI QIDQ2018537FDOQ2018537

Authors: Clément Charpentier, Éric Sopena 

Publication date: 24 March 2015

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2014.10.001

Recommendations

• The game chromatic and chromatic number of some graphs
• Game chromatic index of \(k\)-degenerate graphs
• scientific article; zbMATH DE number 398953
• A bound for the game chromatic number of graphs
• The incidence game chromatic number of paths and subgraphs of wheels
• Incidence Coloring Game and Arboricity of Graphs
• A note on the game chromatic index of graphs
• The game chromatic number of some join graphs
• scientific article; zbMATH DE number 5670857
• Game chromatic index of graphs with given restrictions on degrees

zbMATH Keywords

arboricityincidence coloringincidence game chromatic number\((a,d)\)-decomposable graphsincidence coloring game

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Decomposition of Finite Graphs Into Forests
• Incidence and strong edge colorings of graphs
• A bound for the game chromatic number of graphs
• Title not available (Why is that?)
• Game chromatic number of outerplanar graphs
• The incidence game chromatic number of paths and subgraphs of wheels
• The Map-Coloring Game
• Incidence coloring of \(k\)-degenerated graphs
• The incidence coloring number of Halin graphs and outerplanar graphs
• Covering planar graphs with forests, one having bounded maximum degree
• The incidence coloring conjecture for graphs of maximum degree 3
• ON THE COMPLEXITY OF SOME COLORING GAMES
• The game coloring number of planar graphs
• A simple competitive graph coloring algorithm
• Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
• Refined activation strategy for the marking game
• Radius two trees specify χ‐bounded classes
• Game chromatic number of toroidal grids
• Edge-partitions of planar graphs and their game coloring numbers
• Decompositions of quadrangle-free planar graphs
• Decomposing a graph into forests
• Title not available (Why is that?)
• Incidence Coloring Game and Arboricity of Graphs
• The incidence game chromatic number
• Lightness of digraphs in surfaces and directed game chromatic number
• Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers

Cited In (6)

• Indicated coloring game on Cartesian products of graphs
• The incidence game chromatic number
• Title not available (Why is that?)
• The incidence game chromatic number of paths and subgraphs of wheels
• Decomposing 4-connected planar triangulations into two trees and one path
• On the game coloring index of \(F^+\)-decomposable graphs

This page was built for publication: The incidence game chromatic number of \((a,d)\)-decomposable graphs

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