Pages that link to "Item:Q1055450"
From MaRDI portal
The following pages link to Graph minors. I. Excluding a forest (Q1055450):
Displaying 50 items.
- Contraction obstructions for connected graph searching (Q298950) (← links)
- Computing directed pathwidth in \(O(1.89^n)\) time (Q300464) (← links)
- An asymptotic analysis of labeled and unlabeled \(k\)-trees (Q308942) (← links)
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- Characterizing width two for variants of treewidth (Q344827) (← links)
- On minimum cost edge searching (Q391138) (← links)
- Random graphs from a weighted minor-closed class (Q396764) (← links)
- Optimization problems in dotted interval graphs (Q400519) (← links)
- Grid minors in damaged grids (Q405308) (← links)
- The complexity of minimum convex coloring (Q415283) (← links)
- \textsc{max-cut} and containment relations in graphs (Q441861) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- The complexity of minimum-length path decompositions (Q494076) (← links)
- Neighbourhood-width of trees (Q501055) (← links)
- Forbidden directed minors and Kelly-width (Q501668) (← links)
- Lower bounds for positive semidefinite zero forcing and their applications (Q512866) (← links)
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- Bandwidth and pathwidth of three-dimensional grids (Q534058) (← links)
- Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time (Q553343) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Minesweeper on graphs (Q632908) (← links)
- Tradeoffs in process strategy games with application in the WDM reconfiguration problem (Q638539) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- Cellular resolutions of cointerval ideals (Q663247) (← links)
- A simple linear-time algorithm for finding path-decompositions of small width (Q672094) (← links)
- Mixed searching and proper-path-width (Q674341) (← links)
- Excluding a large theta graph (Q723880) (← links)
- Exclusive graph searching vs. pathwidth (Q729824) (← links)
- Graph minors. III. Planar tree-width (Q799684) (← links)
- The structure of the models of decidable monadic theories of graphs (Q810005) (← links)
- The treewidth and pathwidth of hypercubes (Q819827) (← links)
- The edge-Erdős-Pósa property (Q822640) (← links)
- A note on multiflows and treewidth (Q834591) (← links)
- Parameterized power domination complexity (Q844180) (← links)
- Strong-mixed searching and pathwidth (Q867027) (← links)
- A local characterization of bounded clique-width for line graphs (Q868337) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- A little statistical mechanics for the graph theorist (Q973134) (← links)
- A spectral lower bound for the treewidth of a graph and its consequences (Q1014419) (← links)
- Derivation of algorithms for cutwidth and related graph layout parameters (Q1015810) (← links)
- Universal augmentation schemes for network navigability (Q1019170) (← links)
- The NLC-width and clique-width for powers of graphs of bounded tree-width (Q1028448) (← links)
- AND/OR search spaces for graphical models (Q1028898) (← links)
- Computational study on planar dominating set problem (Q1040587) (← links)
- Submodular partition functions (Q1045090) (← links)
- Graph minors. V. Excluding a planar graph (Q1079583) (← links)
- Grids and their minors (Q1097897) (← links)
- On embedding graphs in trees (Q1103631) (← links)
- On well-quasi-ordering-finite graphs by immersion (Q1104345) (← links)
