Addendum to: The complexity of regular subgraph recognition

DOI10.1016/0166-218X(91)90058-5MaRDI QIDQ1175798zbMATH OpenFDO

Authors F. Cheah, Derek G. Corneil

Publication date 25 June 1992

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218X(91)90058-5

zbMATH Keywords

NP-completeregular subgraph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Review text

In this addendum, the authors acknowledge that some of the results from their paper [The complexity of regular subgraph recognition, Discrete Appl. Math. 27, No. 1/2, 59-68 (1990; Zbl 0698.68040)] have been published by the reviewer in 1984, see \textit{J. Plesnik} [Discrete Math. 49, 161-167 (1984; Zbl 0567.05029)].

Recommendations

• The complexity of regular subgraph recognition
• A note on the complexity of finding regular subgraphs
• scientific article; zbMATH DE number 930115
• Letter to the editor
• On the complexity of the maximum subgraph problem

Cites work

• A note on the complexity of finding regular subgraphs
• The complexity of regular subgraph recognition

Cited in

(2)

• A note on the complexity of finding regular subgraphs
• The complexity of regular subgraph recognition

This page was built for publication: Addendum to: The complexity of regular subgraph recognition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1175798)