The relaxed edge-coloring game and k-degenerate graphs

DOI10.1007/S11083-014-9336-6MaRDI QIDQ890010zbMATH OpenOpenAlexFDO

Authors Charles Dunn, David Morawski, Jennifer Firkins Nordstrom

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

zbMATH Keywords

edge coloring\(k\)-degenerate graphcompetitive coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Recommendations

• The relaxed game chromatic index of \(k\)-degenerate graphs
• The relaxed game chromatic number of graphs with cut-vertices
• Relaxed game chromatic number of graphs
• Game chromatic index of \(k\)-degenerate graphs
• Relaxed very asymmetric coloring games

Cites work

• scientific article; zbMATH DE number 398953 (Why is no real title available?)
• scientific article; zbMATH DE number 1250667 (Why is no real title available?)
• A bound for the game chromatic number of graphs
• A simple competitive graph coloring algorithm
• A simple competitive graph coloring algorithm. II.
• A simple competitive graph coloring algorithm. III
• Complete multipartite graphs and the relaxed coloring game
• Defective coloring revisited
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Game chromatic index of \(k\)-degenerate graphs
• Game chromatic number of outerplanar graphs
• List Improper Colourings of Planar Graphs
• Marking games and the oriented game chromatic number of partial k-trees
• Note on the game chromatic index of trees
• Radius two trees specify χ‐bounded classes
• Relaxed coloring of a graph
• Relaxed game chromatic number of graphs
• Relaxed game chromatic number of trees and outerplanar graphs
• The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\)
• The game coloring number of planar graphs
• The game coloring number of pseudo partial \(k\)-trees
• The relaxed game chromatic index of \(k\)-degenerate graphs
• The relaxed game chromatic number of outerplanar graphs

Cited in

(5)

• Introduction to competitive graph coloring
• The relaxed game chromatic number of graphs with cut-vertices
• The slow-coloring game on sparse graphs: \(k\)-degenerate, planar, and outerplanar
• The relaxed game chromatic index of \(k\)-degenerate graphs
• Game chromatic index of \(k\)-degenerate graphs

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)