On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
Sign Up to like & getrecommendations! Published in 2020 at "Algorithmica"
DOI: 10.1007/s00453-020-00758-8
Abstract: We study the parameterized complexity of the Bounded-Degree Vertex Deletion problem (BDD), where the aim is to find a maximum induced subgraph whose maximum degree is below a given degree bound. Our focus lies on… read more here.
Keywords: bounded degree; degree vertex; vertex deletion; problem ... See more keywords
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization
Sign Up to like & getrecommendations! Published in 2021 at "Algorithmica"
DOI: 10.1007/s00453-021-00798-8
Abstract: A matching cut is a partition of the vertex set of a graph into two sets A and B such that each vertex has at most one neighbor in the other side of the cut.… read more here.
Keywords: bounded degree; degree complexity; cuts bounded; matching cut ... See more keywords
Spanning Trees of Bounded Degree, Connectivity, Toughness, and the Spectrum of a Graph
Sign Up to like & getrecommendations! Published in 2020 at "Bulletin of the Iranian Mathematical Society"
DOI: 10.1007/s41980-020-00375-9
Abstract: Recently, Cioabǎ and Gu obtained a relationship between the spectrum of a regular graph and the existence of spanning trees of bounded degree, generalized connectivity and toughness, respectively. In this paper, motivated by the idea… read more here.
Keywords: bounded degree; spanning trees; connectivity; trees bounded ... See more keywords
On Trees of Bounded Degree with Maximal Number of Greatest Independent Sets
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Applied and Industrial Mathematics"
DOI: 10.1134/s1990478918020175
Abstract: Given n and d, we describe the structure of trees with the maximal possible number of greatest independent sets in the class of n-vertex trees of vertex degree at most d.We show that the extremal… read more here.
Keywords: bounded degree; greatest independent; trees bounded; number greatest ... See more keywords