scientific article; zbMATH DE number 2188410

zbMath1071.05575MaRDI QIDQ5461510

Richard H. Hammack

Publication date: 26 July 2005

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

cyclicitycycle graphgraph contraction

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Increasing the Minimum Degree of a Graph by Contractions ⋮ Increasing the minimum degree of a graph by contractions ⋮ The complexity of contracting bipartite graphs into small cycles ⋮ Contracting to a longest path in H-free graphs ⋮ The computational complexity of disconnected cut and \(2 K_2\)-partition ⋮ Contracting bipartite graphs to paths and cycles ⋮ Contracting bipartite graphs to paths and cycles

This page was built for publication: