Publication:5461510
From MaRDI portal
zbMath1071.05575MaRDI QIDQ5461510
Publication date: 26 July 2005
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Contracting bipartite graphs to paths and cycles, Contracting bipartite graphs to paths and cycles, The complexity of contracting bipartite graphs into small cycles, Contracting to a longest path in H-free graphs, Increasing the minimum degree of a graph by contractions, The computational complexity of disconnected cut and \(2 K_2\)-partition, Increasing the Minimum Degree of a Graph by Contractions