Square contractions of graphs

MaRDI QIDQ3412125zbMATH OpenFDO

Authors Richard H. Hammack

Publication date 5 December 2006

zbMATH Keywords

algorithmcomplexitycyclicityNP-completeradius

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Contractibility and NP-completeness
• The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases
• The complexity of graph contractions.
• The computational complexity of graph contractions II: Two tough polynomially solvable cases
• On contracting graphs to fixed pattern graphs

Cited in

(2)

• scientific article; zbMATH DE number 1545700 (Why is no real title available?)
• scientific article; zbMATH DE number 4120196 (Why is no real title available?)

This page was built for publication: Square contractions of graphs

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