Pages that link to "Item:Q2493118"
From MaRDI portal
The following pages link to Tree-depth, subgraph coloring and homomorphism bounds (Q2493118):
Displayed 16 items.
- Homomorphisms and edge-colourings of planar graphs (Q875942) (← links)
- Nonrepetitive colorings of graphs -- a survey (Q925326) (← links)
- Colouring games on outerplanar graphs and trees (Q1025941) (← links)
- A surprising permanence of old motivations (a not-so-rigid story) (Q1045032) (← links)
- Colouring graphs with bounded generalized colouring number (Q1045038) (← links)
- On the complexity of \(H\)-colouring planar graphs (Q1045065) (← links)
- Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor (Q1045075) (← links)
- Grad and classes with bounded expansion. I: Decompositions (Q2426456) (← links)
- Grad and classes with bounded expansion. II: Algorithmic aspects (Q2426457) (← links)
- Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities (Q2427548) (← links)
- The Grad of a Graph and Classes with Bounded Expansion (Q3439315) (← links)
- Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets (Q3439562) (← links)
- Fraternal Augmentations of graphs, Coloration and Minors (Q3439588) (← links)
- Finite Automata, Digraph Connectivity, and Regular Expression Size (Q3520302) (← links)
- On Digraph Width Measures in Parameterized Algorithmics (Q3656861) (← links)
- Nonrepetitive colorings of graphs (Q5899395) (← links)