Pages that link to "Item:Q1045038"
From MaRDI portal
The following pages link to Colouring graphs with bounded generalized colouring number (Q1045038):
Displaying 49 items.
- Adapted game colouring of graphs (Q412230) (← links)
- Colouring edges with many colours in cycles (Q462927) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- Rank-width and tree-width of \(H\)-minor-free graphs (Q709231) (← links)
- Rainbow independent sets on dense graph classes (Q831859) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- Colouring games on outerplanar graphs and trees (Q1025941) (← links)
- Generalization of transitive fraternal augmentations for directed graphs and its applications (Q1043997) (← links)
- Characterising bounded expansion by neighbourhood complexity (Q1621072) (← links)
- Chromatic numbers of exact distance graphs (Q1633747) (← 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)
- Polynomial treedepth bounds in linear colorings (Q2223702) (← 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)
- Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs (Q2662795) (← links)
- Bounds on half graph orders in powers of sparse graphs (Q2699651) (← links)
- Colouring and Covering Nowhere Dense Graphs (Q2827820) (← links)
- Counting Homomorphisms to Sparse Graphs (Q2851494) (← links)
- Many Facets of Dualities (Q2971613) (← links)
- Bounds on vertex colorings with restrictions on the union of color classes (Q3083409) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Coloring and Covering Nowhere Dense Graphs (Q4553722) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
- Sublinear Separators in Intersection Graphs of Convex Shapes (Q4992837) (← links)
- (Q5090497) (← 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)
- Erdös--Hajnal Properties for Powers of Sparse Graphs (Q5857003) (← links)
- On the generalised colouring numbers of graphs that exclude a fixed minor (Q5890918) (← links)
- On low rank-width colorings (Q5918207) (← links)
- On the generalised colouring numbers of graphs that exclude a fixed minor (Q5920084) (← links)
- A distributed low tree-depth decomposition algorithm for bounded expansion classes (Q5964897) (← links)
- Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth (Q6080127) (← links)
- (Q6089655) (← links)
- Shallow Minors, Graph Products, and Beyond-Planar Graphs (Q6130539) (← links)
- Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes (Q6135763) (← links)
- Graph product structure for non-minor-closed classes (Q6170788) (← 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)
- Hardness of the generalized coloring numbers (Q6614401) (← links)
- Discrepancy and sparsity (Q6615750) (← links)
- Treelike decompositions for transductions of sparse graphs (Q6649461) (← links)
