Pages that link to "Item:Q473098"
From MaRDI portal
The following pages link to The structure of graphs not admitting a fixed immersion (Q473098):
Displayed 35 items.
- Coloring immersion-free graphs (Q326817) (← links)
- Effective computation of immersion obstructions for unions of graph classes (Q395009) (← links)
- Characterising bounded expansion by neighbourhood complexity (Q1621072) (← links)
- An FPT 2-approximation for tree-cut decomposition (Q1702123) (← links)
- Cutwidth: obstructions and algorithmic aspects (Q1725643) (← links)
- The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs (Q1748270) (← links)
- Packing and covering immersions in 4-edge-connected graphs (Q1984514) (← links)
- A Menger-like property of tree-cut width (Q1998754) (← links)
- Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (Q2105427) (← links)
- On objects dual to tree-cut decompositions (Q2171026) (← links)
- Edge degeneracy: algorithmic and structural results (Q2196572) (← links)
- On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
- Parameterized complexity of the MinCCA problem on graphs of bounded decomposability (Q2399617) (← links)
- Packing and covering immersion-expansions of planar sub-cubic graphs (Q2400977) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
- Characterizing graphs of small carving-width (Q2446832) (← links)
- Lift-contractions (Q2509756) (← links)
- The power of cut-based parameters for computing edge-disjoint paths (Q2659778) (← links)
- A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three (Q2668021) (← links)
- Computing partial hypergraphs of bounded width (Q2686128) (← links)
- The complexity of routing problems in forbidden-transition graphs and edge-colored graphs (Q2701383) (← links)
- A Structure Theorem for Strong Immersions (Q2825487) (← links)
- Algorithmic Applications of Tree-Cut Width (Q2946405) (← links)
- Packing and Covering Immersion Models of Planar Subcubic Graphs (Q3181048) (← links)
- On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem (Q3304132) (← links)
- Algorithmic Applications of Tree-Cut Width (Q5048301) (← links)
- Lean Tree-Cut Decompositions: Obstructions and Algorithms (Q5090482) (← links)
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes (Q5150814) (← links)
- Forcing clique immersions through chromatic number (Q5892297) (← links)
- Problems hard for treewidth but easy for stable gonality (Q6039413) (← links)
- Edge-cut width: an algorithmically driven analogue of treewidth based on edge cuts (Q6039417) (← links)
- Spined categories: generalizing tree-width beyond graphs (Q6056559) (← links)
- (Q6065468) (← links)
- Edge-treewidth: algorithmic and combinatorial properties (Q6069149) (← links)
- The immersion-minimal infinitely edge-connected graph (Q6144409) (← links)