On locating cubic subgraphs in bounded-degree connected bipartite graphs
From MaRDI portal
Publication:1356566
DOI10.1016/0012-365X(95)00324-PzbMath0873.68097OpenAlexW2023540209WikidataQ127155184 ScholiaQ127155184MaRDI QIDQ1356566
Publication date: 9 June 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(95)00324-p
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width, Finding regular subgraphs in both arbitrary and planar graphs, Tight complexity bounds for FPT subgraph problems parameterized by the clique-width, Complexity of finding maximum regular induced subgraphs with prescribed degree, Editing graphs to satisfy degree constraints: a parameterized approach, A survey of parameterized algorithms and the complexity of edge modification, Graph editing problems with extended regularity constraints, Parameterized complexity of finding regular induced subgraphs, Parameterized Graph Editing with Chosen Vertex Degrees, Program schemes, arrays, Lindström quantifiers and zero-one laws
Cites Work
