Search results

From MaRDI portal
View ( | ) (20 | 50 | 100 | 250 | 500)
  • Tree Deletion Set Has a Polynomial Kernel but No $\text{OPT}^\mathcal{O}(1)$ Approximation) 2016-07-22 Paper The Structure of $W_4$-Immersion-Free Graphs...
    10 bytes (18 words) - 07:10, 7 October 2023
  • problem 2022-02-14 Paper On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs 2022-01-13 Paper Group colorings and DP-colorings of multigraphs...
    10 bytes (19 words) - 14:02, 8 December 2023
  • 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity 2011-10-12 Paper Toughness of \(K_{a,t}\)-minor-free graphs 2011-07-29...
    10 bytes (16 words) - 17:22, 9 December 2023
  • Coloring Problems on H-Free Graphs 2013-03-21 Paper Detecting Induced Minors in AT-Free Graphs 2013-03-21 Paper Choosability on \(H\)-free graphs 2013-03-20...
    10 bytes (16 words) - 13:28, 8 December 2023
  • Promise SAT on Non-Boolean Domains 2022-03-29 Paper Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes 2021-02-15 Paper Improved hardness...
    10 bytes (17 words) - 06:00, 7 October 2023
  • 2021-02-02 Paper Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs 2021-02-02 Paper An exponential time parameterized algorithm for...
    10 bytes (16 words) - 09:40, 7 October 2023
  • https://portal.mardi4nfdi.de/entity/Q4634390 2018-04-10 Paper Induced minor free graphs: isomorphism and clique-width 2018-02-28 Paper https://portal.mardi4nfdi...
    10 bytes (17 words) - 19:18, 6 October 2023
  • Perspective 2008-06-05 Paper Wheel-Free Deletion Is W[2-Hard] 2008-06-05 Paper On the Complexity of Reconstructing H-free Graphs from Their Star Systems 2008-04-15...
    10 bytes (17 words) - 11:56, 7 October 2023
  • Four-Coloring \(\boldsymbol{P_6}\)-Free Graphs. II. Finding an Excellent Precoloring 2024-03-19 Paper Four-Coloring \(P_6\)-Free Graphs. I. Extending an Excellent...
    10 bytes (17 words) - 06:00, 7 October 2023
  • transversals in \(H\)-free graphs 2022-03-25 Paper Computing subset transversals in \(H\)-free graphs 2022-01-18 Paper List \(k\)-colouring \(P_t\)-free graphs: a...
    10 bytes (16 words) - 16:47, 6 October 2023
  • Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor 2020-01-15 Paper Linear-Time Recognition of Double-Threshold...
    10 bytes (17 words) - 02:03, 7 October 2023
  • Bandwidth on AT-free graphs 2011-12-07 Paper Graphs of linear clique-width at most 3 2011-10-10 Paper Parameterized Complexity of Vertex Deletion into Perfect...
    10 bytes (17 words) - 01:27, 10 December 2023
  • An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion 2017-10-10 Paper Parameterized Algorithms for Min-Max Multiway Cut and...
    10 bytes (17 words) - 03:20, 25 September 2023
  • claw-free graphs 2006-09-14 Paper https://portal.mardi4nfdi.de/entity/Q5714874 2005-12-16 Paper Hamilton connectivity of line graphs and claw‐free graphs...
    10 bytes (16 words) - 22:35, 8 December 2023
  • common subgraph problems in series-parallel graphs 2017-11-14 Paper Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest...
    10 bytes (17 words) - 07:16, 12 December 2023
  • Random Graphs 2006-06-01 Paper \(H\)-free graphs of large minimum degree 2006-03-22 Paper MaxCut in ${\bm H)$-Free Graphs 2005-11-14 Paper Disjoint representability...
    10 bytes (17 words) - 10:55, 9 December 2023
  • Paper The change of Seidel energy of tripartite Turán graph due to edge deletion 2023-04-13 Paper Catastrophe control of aphid populations model 2023-02-28...
    10 bytes (17 words) - 11:33, 9 December 2023
  • 2-connected deletion-minors of binary matroids 2013-12-02 Paper Strongly rigid tensegrity graphs on the line 2013-04-25 Paper Complex zero-free regions at...
    10 bytes (16 words) - 02:17, 10 December 2023
  • Turán Problem and its Applications 2021-12-09 Paper Constructing dense grid-free linear $3$-graphs 2021-11-09 Paper On Erdős’s Method for Bounding the Partition...
    10 bytes (17 words) - 13:25, 6 October 2023
  • Eigenvalues of K1,k-Free Graphs and the Connectivity of Their Independence Complexes 2016-11-17 Paper Many \(T\) copies in \(H\)-free graphs 2016-10-14 Paper...
    10 bytes (17 words) - 19:58, 8 December 2023
View ( | ) (20 | 50 | 100 | 250 | 500)