Orderings on Graphs and Game Coloring Number
Authors:
- 1 September 2003
- journal article
- Published by Springer Nature in Order
- Vol. 20 (3) , 255-264
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Marking Games and the Oriented Game Chromatic Number of Partial k -TreesGraphs and Combinatorics, 2003
- Competitive Colorings of Oriented GraphsThe Electronic Journal of Combinatorics, 2000
- On the Oriented Game Chromatic NumberThe Electronic Journal of Combinatorics, 2000
- The game coloring number of pseudo partial k-treesDiscrete Mathematics, 2000
- A Simple Competitive Graph Coloring AlgorithmJournal of Combinatorial Theory, Series B, 2000
- The Game Coloring Number of Planar GraphsJournal of Combinatorial Theory, Series B, 1999
- A bound for the game chromatic number of graphsDiscrete Mathematics, 1999
- Topological cliques in graphs IICombinatorics, Probability and Computing, 1996
- Planar graph coloring with an uncooperative partnerJournal of Graph Theory, 1994
- Graphs with Linearly Bounded Ramsey NumbersJournal of Combinatorial Theory, Series B, 1993