Search results
From MaRDI portal
- \(\mathcal{F} \)-minor-free deletion 2021-04-14 Paper A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F}\)-minor-free deletion 2020-02-24...10 bytes (16 words) - 10:09, 25 September 2023
- kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion 2021-04-14 Paper Lower Bounds for Dynamic Programming on Planar Graphs...10 bytes (20 words) - 12:41, 7 October 2023
- Partitioning \(H\)-minor free graphs into three subgraphs with no large components 2016-10-14 Paper Dynamic coloring of graphs having no \(K_5\) minor 2016-05-02...10 bytes (19 words) - 23:39, 9 December 2023
- matroids 2002-12-10 Paper Matroid 4-connectivity: A deletion-contraction theorem 2002-12-10 Paper Totally free expansions of matroids. 2002-12-10 Paper Branch-width...10 bytes (18 words) - 12:02, 13 December 2023
- graphs 2007-05-29 Paper Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs 2007-05-29 Paper Connected Graph Searching in Outerplanar...10 bytes (19 words) - 15:04, 10 December 2023
- 2002-12-10 Paper Matroid 4-connectivity: A deletion-contraction theorem 2002-12-10 Paper Totally free expansions of matroids. 2002-12-10 Paper Branch-width and...10 bytes (18 words) - 16:28, 9 December 2023
- \(H\)-minor-free graphs 2010-10-18 Paper Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions 2010-09-27 Paper Fast Minor Testing...10 bytes (19 words) - 23:54, 9 December 2023
- 2023-05-05 Paper Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering 2023-04-04 Paper Parameterized...10 bytes (16 words) - 16:38, 10 December 2023
- excluded minor 2023-12-08 Paper https://portal.mardi4nfdi.de/entity/Q6065468 2023-11-14 Paper Finding large induced sparse subgraphs in c >t -free graphs...10 bytes (18 words) - 09:05, 7 October 2023
- 2013-03-21 Paper Choosability on \(H\)-free graphs 2013-03-20 Paper Exact algorithms for finding longest cycles in claw-free graphs 2013-03-05 Paper Computing...10 bytes (20 words) - 18:16, 11 December 2023
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes 2021-02-15 Paper A tight Erdős-Pósa function for planar minors 2020-10-20 Paper On...10 bytes (18 words) - 14:13, 6 October 2023
- 2012-06-15 Paper 4-Coloring H-Free Graphs When H Is Small 2012-06-15 Paper Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial...10 bytes (19 words) - 23:54, 9 December 2023
- indices on resistance-distance 2022-09-15 Paper Acyclic coloring of claw-free graphs with small degree 2022-09-15 Paper List 2-distance coloring of planar...10 bytes (17 words) - 02:43, 10 December 2023
- 2016-11-14 Paper Hitting Forbidden Minors: Approximation and Kernelization 2016-03-04 Paper Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel...10 bytes (16 words) - 09:53, 7 October 2023
- isomorphism in graphs with an excluded minor 2023-12-08 Paper Finding large induced sparse subgraphs in c >t -free graphs in quasipolynomial time 2023-11-14...10 bytes (17 words) - 02:52, 7 October 2023
- Fast minor testing in planar graphs 2012-11-21 Paper Parameterized Domination in Circle Graphs 2012-11-06 Paper Dynamic Programming for H-minor-free Graphs...10 bytes (17 words) - 14:13, 6 October 2023
- Algorithms for Weighted-ℱ-deletion Problems 2023-04-26 Paper Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth...10 bytes (17 words) - 02:43, 25 September 2023
- Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes 2021-10-04 Paper Parameterized Complexity of Conflict-Free Graph Coloring 2021-09-17 Paper...10 bytes (19 words) - 07:47, 9 December 2023
- 4-connected binary matroids without a prism+\(e\) minor 2015-05-05 Paper On regular matroids without certain minors 2015-05-05 Paper https://portal.mardi4nfdi...10 bytes (19 words) - 17:22, 9 December 2023
- 2016-06-16 Paper Element deletion changes in dynamic coloring of graphs 2016-04-07 Paper Hamilton circuits and essential girth of claw free graphs 2016-03-02...10 bytes (17 words) - 21:25, 9 December 2023
