Pages that link to "Item:Q1826511"
From MaRDI portal
The following pages link to Orderings on graphs and game coloring number (Q1826511):
Displaying 48 items.
- Coloring games on squares of graphs (Q408174) (← links)
- Adapted game colouring of graphs (Q412230) (← links)
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory (Q579273) (← links)
- Boxicity, poset dimension, and excluded minors (Q668021) (← links)
- Rank-width and tree-width of \(H\)-minor-free graphs (Q709231) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- On forbidden subdivision characterizations of graph classes (Q925035) (← links)
- Nonrepetitive colorings of graphs -- a survey (Q925326) (← links)
- Activation strategy for relaxed asymmetric coloring games (Q1025957) (← links)
- Generalization of transitive fraternal augmentations for directed graphs and its applications (Q1043997) (← links)
- Colouring graphs with bounded generalized colouring number (Q1045038) (← links)
- Chromatic numbers of exact distance graphs (Q1633747) (← links)
- The strong game colouring number of directed graphs (Q1945951) (← links)
- The game Grundy number of graphs (Q1956234) (← links)
- Polynomial bounds for centered colorings on proper minor-closed graph classes (Q1984513) (← links)
- Notes on graph product structure theory (Q2058955) (← links)
- Twin-width and generalized coloring numbers (Q2065919) (← links)
- Improved bounds for weak coloring numbers (Q2121806) (← links)
- On coloring numbers of graph powers (Q2174571) (← links)
- Clustering powers of sparse graphs (Q2209886) (← links)
- Game chromatic number of generalized Petersen graphs and Jahangir graphs (Q2218005) (← links)
- Uniform orderings for generalized coloring numbers (Q2225419) (← links)
- On the weak 2-coloring number of planar graphs (Q2237215) (← links)
- 2-coloring number revisited (Q2333797) (← links)
- On nowhere dense graphs (Q2430977) (← links)
- On the tree-depth of random graphs (Q2442213) (← links)
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs (Q2664559) (← links)
- Colouring and Covering Nowhere Dense Graphs (Q2827820) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Efficient Graph Packing via Game Colouring (Q3552503) (← links)
- Game coloring the Cartesian product of graphs (Q3605153) (← links)
- Coloring and Covering Nowhere Dense Graphs (Q4553722) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness (Q5140724) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q5234662) (← links)
- On Treewidth and Related Parameters of Random Geometric Graphs (Q5270409) (← links)
- On the generalised colouring numbers of graphs that exclude a fixed minor (Q5890918) (← links)
- Nonrepetitive colorings of graphs (Q5899395) (← links)
- On low rank-width colorings (Q5918207) (← links)
- On the generalised colouring numbers of graphs that exclude a fixed minor (Q5920084) (← links)
- Shallow Minors, Graph Products, and Beyond-Planar Graphs (Q6130539) (← links)
- Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes (Q6135763) (← links)
- A color-avoiding approach to subgraph counting in bounded expansion classes (Q6174815) (← links)
- Dimension is polynomial in height for posets with planar cover graphs (Q6187346) (← links)
- Sparse graphs without long induced paths (Q6196152) (← links)
- Hardness of the generalized coloring numbers (Q6614401) (← links)
- Discrepancy and sparsity (Q6615750) (← links)
- Linear colouring of binomial random graphs (Q6646401) (← links)
