Maximum Induced Forests in Graphs of Bounded Treewidth

Electronic Journal of Combinatorics - United States
doi 10.37236/3826
Full Text
Abstract

Available in full text

Date
Authors
Publisher

The Electronic Journal of Combinatorics

Related search

Minimum Activation Cost Node-Disjoint Paths in Graphs With Bounded Treewidth

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Fine-Grained Complexity of Graph Homomorphism Problem for Bounded-Treewidth Graphs

2020English

The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

A Complexity Dichotomy for Hitting Connected Minors on Bounded Treewidth Graphs: The Chair and the Banner Draw the Boundary

2020English

Sparse Universal Graphs for Bounded-Degree Graphs

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2007English

Testing Expansion in Bounded-Degree Graphs

2007English

Minimum Fill-In and Treewidth of Split+ Ke and Split+ Kv Graphs

English

On the Dimension of Posets With Cover Graphs of Treewidth 2

Order
AlgebraGeometryNumber TheoryComputational TheoryMathematicsTopology
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy