Pages that link to "Item:Q705888"
From MaRDI portal
The following pages link to Graph minors. XX: Wagner's conjecture (Q705888):
Displaying 50 items.
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197) (← links)
- Fixed-parameter tractable distances to sparse graph classes (Q2408199) (← links)
- The \(k\)-strong induced arboricity of a graph (Q2408964) (← links)
- Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets (Q2412632) (← links)
- Well-quasi-ordering \(H\)-contraction-free graphs (Q2413963) (← links)
- Characterizing graphs of maximum matching width at most 2 (Q2413972) (← links)
- Maximum matching width: new characterizations and a fast algorithm for dominating set (Q2413973) (← links)
- Infinitely many minimal classes of graphs of unbounded clique-width (Q2413975) (← links)
- Positive-instance driven dynamic programming for treewidth (Q2424727) (← links)
- Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices (Q2427899) (← links)
- Obtaining a planar graph by vertex deletion (Q2429328) (← links)
- Square roots of minor closed graph classes (Q2442205) (← links)
- Many, many more intrinsically knotted graphs (Q2453739) (← links)
- Vertex-minor reductions can simulate edge contractions (Q2457014) (← links)
- Graphs and obstructions in four dimensions. (Q2490839) (← links)
- On tree width, bramble size, and expansion (Q2519023) (← links)
- Excluding a group-labelled graph (Q2519025) (← links)
- Variations on a theme of Kuratowski (Q2575783) (← links)
- Knots and links in spatial graphs: a survey (Q2575796) (← links)
- Some notes on bounded starwidth graphs (Q2628278) (← links)
- The minor minimal intrinsically chiral graphs (Q2659075) (← links)
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs (Q2661217) (← links)
- Integer packing sets form a well-quasi-ordering (Q2661623) (← links)
- A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion (Q2662677) (← links)
- A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three (Q2668021) (← links)
- Local 2-separators (Q2673481) (← links)
- Clique immersions and independence number (Q2674557) (← links)
- Family sizes for complete multipartite graphs (Q2681321) (← links)
- On strict brambles (Q2689118) (← links)
- Triangle-free projective-planar graphs with diameter two: domination and characterization (Q2691564) (← links)
- Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\) (Q2692778) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- Face-width of embedded graphs (Q2702745) (← links)
- Obstruction sets for outer-cylindrical graphs (Q2746484) (← links)
- Excluded minors and the ribbon graphs of knots (Q2800591) (← links)
- Cut dominants and forbidden minors (Q2818204) (← links)
- Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes (Q2819509) (← links)
- A structure theorem for strong immersions (Q2825487) (← links)
- Well-quasi-ordering Does Not Imply Bounded Clique-width (Q2827822) (← links)
- Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques (Q2827832) (← links)
- FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders (Q2828222) (← links)
- Graph classes with given 3-connected components: asymptotic enumeration and random graphs (Q2841679) (← links)
- Reoptimization under vertex insertion: max \(P_{k}\)-free subgraph and max planar subgraph (Q2846477) (← links)
- Outerplanar obstructions for the feedback vertex set (Q2851458) (← links)
- Obstructions for tree-depth (Q2851471) (← links)
- Well-quasi-ordering hereditarily finite sets (Q2855754) (← links)
- Square roots of minor closed graph classes (Q2857427) (← links)
- Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices (extended abstract) (Q2857429) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- Fixed-Parameter Tractability, A Prehistory, (Q2908528) (← links)
