Addendum to: The complexity of regular subgraph recognition

DOI10.1016/0166-218X(91)90058-5zbMath0737.05069MaRDI QIDQ1175798

F. Cheah, Derek Gordon Corneil

Publication date: 25 June 1992

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

zbMATH Keywords

NP-completeregular subgraph

Mathematics Subject Classification ID

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

Cites Work

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