Search results
From MaRDI portal
- \(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
- fragmentation, and graphs of (locally) bounded treewidth 2007-05-30 Paper Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs 2007-05-29 Paper...10 bytes (19 words) - 23:41, 9 December 2023
- 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 time...10 bytes (19 words) - 23:54, 9 December 2023
- of \(K_{a,t}\)-minor-free graphs 2011-07-29 Paper Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs 2011-07-06 Paper...10 bytes (19 words) - 10:02, 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
- spaces and graphs 2009-02-12 Paper A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs 2009-02-03 Paper Navigating in a Graph by Aid of Its...10 bytes (18 words) - 03:20, 25 September 2023
- edge-colored graphs 2023-04-28 Paper Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering 2023-04-04...10 bytes (18 words) - 09:05, 7 October 2023
- tractability of graph isomorphism in graphs with an excluded minor 2023-12-08 Paper Finding large induced sparse subgraphs in c >t -free graphs in quasipolynomial...10 bytes (17 words) - 02:52, 7 October 2023
- Structural Results for Apex-Minor-Free Graphs 2009-07-14 Paper Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs 2009-07-14 Paper On Cartesian...10 bytes (19 words) - 15:25, 9 December 2023
- number of squares of random graphs 2023-04-19 Paper Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern...10 bytes (17 words) - 11:56, 7 October 2023
- approximation schemes for K3, 3-minor-free or K5-minor-free graphs 2007-05-29 Paper Connected Graph Searching in Outerplanar Graphs 2007-05-29 Paper The Bidimensional...10 bytes (19 words) - 15:04, 10 December 2023
- and enumeration of \(K_4\)-minor-free links and link-diagrams 2020-09-15 Paper Minor-obstructions for apex sub-unicyclic graphs 2020-07-07 Paper Encoding...10 bytes (16 words) - 16:48, 6 October 2023
- Paper \(r\)-hued coloring of sparse graphs 2018-02-22 Paper Compatible cycle decomposition of bad \(K_5\)-minor-free graphs 2018-01-18 Paper Multiple weak 2-linkage...10 bytes (17 words) - 14:44, 8 December 2023
- Toughness of \(K_{a,t}\)-minor-free graphs 2011-07-29 Paper Crossing number and weighted crossing number of near-planar graphs 2011-06-30 Paper The genus...10 bytes (17 words) - 20:26, 8 December 2023
- 2023-04-26 Paper Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering 2023-04-04 Paper Circumventing...10 bytes (17 words) - 02:43, 25 September 2023
- algorithms for (\(P_5\), gem)-free graphs 2006-03-20 Paper Equitable colorings of bounded treewidth graphs 2006-03-20 Paper Graph-Theoretic Concepts in Computer...10 bytes (19 words) - 07:47, 9 December 2023
- transductions of proper \(k\)-mixed-thin graphs 2023-05-05 Paper Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs 2023-02-16 Paper Bounded degree conjecture...10 bytes (17 words) - 16:33, 8 December 2023
- 2021-08-27 Paper Minimal 2-connected graphs satisfying the even cut condition 2021-03-11 Paper All minor-minimal apex obstructions with connectivity two...10 bytes (18 words) - 09:26, 9 December 2023
- de/entity/Q4398382 1998-07-19 Paper The thickness of a minor-excluded class of graphs 1998-05-13 Paper The thickness of graphs: A survey 1998-04-26 Paper 2-Layer Straightline...10 bytes (17 words) - 07:16, 12 December 2023
- insertion approximates the crossing number of apex graphs 2012-02-11 Paper How Not to Characterize Planar-Emulable Graphs 2012-01-13 Paper Improved Steiner Tree...10 bytes (16 words) - 13:36, 6 October 2023