The relaxed edge-coloring game and k-degenerate graphs
From MaRDI portal
Publication:890010
DOI10.1007/S11083-014-9336-6zbMATH Open1325.05076OpenAlexW2008639999MaRDI QIDQ890010FDOQ890010
Jennifer Firkins Nordstrom, David Morawski, Charles Dunn
Publication date: 9 November 2015
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11083-014-9336-6
Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- A bound for the game chromatic number of graphs
- Marking games and the oriented game chromatic number of partial \(k\)-trees
- Game chromatic number of outerplanar graphs
- List Improper Colourings of Planar Graphs
- The game coloring number of planar graphs
- A simple competitive graph coloring algorithm
- Complete multipartite graphs and the relaxed coloring game
- The game coloring number of pseudo partial \(k\)-trees
- Radius two trees specify χ‐bounded classes
- Defective coloring revisited
- Relaxed game chromatic number of graphs
- Game chromatic index of \(k\)-degenerate graphs
- Note on the game chromatic index of trees
- The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\)
- Relaxed coloring of a graph
- A simple competitive graph coloring algorithm. II.
- Relaxed game chromatic number of trees and outerplanar graphs
- A simple competitive graph coloring algorithm. III
- The relaxed game chromatic index of \(k\)-degenerate graphs
- The relaxed game chromatic number of outerplanar graphs
Cited In (3)
This page was built for publication: The relaxed edge-coloring game and \(k\)-degenerate graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q890010)
