On the minimum cycle cover problem on graphs with bounded co-degeneracy
type: Item
instance of: scholarly article
title: On the minimum cycle cover problem on graphs with bounded co-degeneracy
arXiv ID: 2210.06703
DOI: 10.1007/978-3-031-15914-5_14
author: Gabriel L. Duarte
author: Uéverton S. Souza
published in: Graph-Theoretic Concepts in Computer Science
publication date: 2023-05-05T00:00:00Z
full work available at URL: https://arxiv.org/abs/2210.06703
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7682410
zbMATH Keywords: degeneracy
zbMATH Keywords: complement graph
zbMATH Keywords: cycle cover
zbMATH Keywords: closure
zbMATH Keywords: FPT
zbMATH Keywords: kernel
MaRDI profile type: MaRDI publication profile
cites work: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
cites work: A method in graph theory
cites work: Closure concepts: A survey
cites work: On the Relationship Between Clique-Width and Treewidth
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
cites work: Linear time solvable optimization problems on graphs of bounded clique-width
cites work: Upper bounds to the clique width of graphs
cites work: Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
cites work: Some Theorems on Abstract Graphs
cites work: Connecting constructive notions of ordinals in homotopy type theory
cites work: Computing the largest bond and the maximum connected cut of a graph
cites work: Going Far from Degeneracy
cites work: Q4633895
cites work: Q5417642
cites work: Intractability of Clique-Width Parameterizations
cites work: Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
cites work: Hamiltonicity below Dirac's condition
cites work: Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity
description: scientific article; zbMATH DE number 7682410