Induced tree covering and the generalized Yutsis property
From MaRDI portal
Publication:6547951
DOI10.1007/978-3-031-55601-2_10MaRDI QIDQ6547951
Loana Nogueira, Luís Cunha, Uéverton S. Souza, Gabriel L. Duarte, Fábio Protti
Publication date: 31 May 2024
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
- On the reduction of Yutsis graphs
- Graph structural properties of non-Yutsis graphs allowing fast recognition
- Complexity of the hamiltonian cycle in regular graph problem
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- On the tree cover number of a graph
- Approximating clique-width and branch-width
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Computing the largest bond and the maximum connected cut of a graph
- Intractability of Clique-Width Parameterizations
- Minimum semidefinite rank of outerplanar graphs and the tree cover number
- Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial 2-trees
- The Planar Hamiltonian Circuit Problem is NP-Complete
- Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal
- Parameterized Algorithms
- Euler and bipartite matroids
- Slightly Superexponential Parameterized Problems
- Computing the largest bond of a graph
- On the minimum cycle cover problem on graphs with bounded co-degeneracy
- Connecting constructive notions of ordinals in homotopy type theory
This page was built for publication: Induced tree covering and the generalized Yutsis property
