On the minimum cycle cover problem on graphs with bounded co-degeneracy
From MaRDI portal
Publication:6039424
DOI10.1007/978-3-031-15914-5_14arXiv2210.06703MaRDI QIDQ6039424
Uéverton S. Souza, Gabriel L. Duarte
Publication date: 5 May 2023
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2210.06703
Cites Work
- Unnamed Item
- Unnamed Item
- A method in graph theory
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity
- Closure concepts: A survey
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- Hamiltonicity below Dirac's condition
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- 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
- Going Far from Degeneracy
- Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
- On the Relationship Between Clique-Width and Treewidth
- Some Theorems on Abstract Graphs
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Connecting constructive notions of ordinals in homotopy type theory
This page was built for publication: On the minimum cycle cover problem on graphs with bounded co-degeneracy
