Pages that link to "Item:Q3601929"
From MaRDI portal
The following pages link to Structural Properties of Sparse Graphs (Q3601929):
Displaying 14 items.
- Graph sharing games: complexity and connectivity (Q391088) (← links)
- Adapted game colouring of graphs (Q412230) (← links)
- Sparsity. Graphs, structures, and algorithms (Q419416) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- Rank-width and tree-width of \(H\)-minor-free graphs (Q709231) (← links)
- Small graph classes and bounded expansion (Q965245) (← links)
- Generalization of transitive fraternal augmentations for directed graphs and its applications (Q1043997) (← links)
- FPT algorithms for domination in sparse graphs and beyond (Q1740694) (← links)
- Reconfiguration on sparse graphs (Q1747496) (← links)
- Equitable list tree-coloring of bounded treewidth graphs (Q2220879) (← links)
- Metrics for sparse graphs (Q3656241) (← links)
- On sparse subgraphs preserving connectivity properties (Q4201383) (← links)
- Structural Properties of Sparse Graphs (Q5301017) (← links)