Pages that link to "Item:Q1045038"
From MaRDI portal
The following pages link to Colouring graphs with bounded generalized colouring number (Q1045038):
Displayed 15 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)
- 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)
- On nowhere dense graphs (Q2430977) (← 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)
- On the generalised colouring numbers of graphs that exclude a fixed minor (Q5890918) (← 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)