Orderings on graphs and game coloring number

DOI10.1023/B:ORDE.0000026489.93166.cbzbMath1041.05029OpenAlexW1973674396MaRDI QIDQ1826511

Daqing Yang, Henry A. Kierstead

Publication date: 6 August 2004

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:orde.0000026489.93166.cb

zbMATH Keywords

planar graphs\(k\)-coloring number\(k\)-game coloring number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items

Improved bounds for weak coloring numbers ⋮ Chromatic numbers of exact distance graphs ⋮ Coloring and Covering Nowhere Dense Graphs ⋮ On coloring numbers of graph powers ⋮ Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs ⋮ Coloring games on squares of graphs ⋮ Adapted game colouring of graphs ⋮ On low tree-depth decompositions ⋮ Shallow Minors, Graph Products, and Beyond-Planar Graphs ⋮ Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes ⋮ A color-avoiding approach to subgraph counting in bounded expansion classes ⋮ Dimension is polynomial in height for posets with planar cover graphs ⋮ Sparse graphs without long induced paths ⋮ Bounding generalized coloring numbers of planar graphs using coin models ⋮ The strong game colouring number of directed graphs ⋮ On nowhere dense graphs ⋮ Clustering powers of sparse graphs ⋮ The game Grundy number of graphs ⋮ Unnamed Item ⋮ On the tree-depth of random graphs ⋮ On the generalised colouring numbers of graphs that exclude a fixed minor ⋮ Game chromatic number of generalized Petersen graphs and Jahangir graphs ⋮ On forbidden subdivision characterizations of graph classes ⋮ Nonrepetitive colorings of graphs -- a survey ⋮ Uniform orderings for generalized coloring numbers ⋮ Efficient Graph Packing via Game Colouring ⋮ Boxicity, poset dimension, and excluded minors ⋮ On the weak 2-coloring number of planar graphs ⋮ Polynomial bounds for centered colorings on proper minor-closed graph classes ⋮ On the generalised colouring numbers of graphs that exclude a fixed minor ⋮ Rank-width and tree-width of \(H\)-minor-free graphs ⋮ Game coloring the Cartesian product of graphs ⋮ On low rank-width colorings ⋮ Notes on graph product structure theory ⋮ Activation strategy for relaxed asymmetric coloring games ⋮ Colouring and Covering Nowhere Dense Graphs ⋮ Twin-width and generalized coloring numbers ⋮ Nonrepetitive colorings of graphs ⋮ Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness ⋮ Lossy Kernels for Connected Dominating Set on Sparse Graphs ⋮ Generalization of transitive fraternal augmentations for directed graphs and its applications ⋮ Colouring graphs with bounded generalized colouring number ⋮ Digraphs of Bounded Width ⋮ 2-coloring number revisited ⋮ On Treewidth and Related Parameters of Random Geometric Graphs ⋮ Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness