Increasing the minimum degree of a graph by contractions

DOI10.1016/j.tcs.2013.02.030zbMath1296.05185MaRDI QIDQ385061

Daniël Paulusma, Marcin Kaminski, Petr A. Golovach, Dimitrios M. Thilikos

Publication date: 29 November 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/10711/1/10711.pdf

zbMATH Keywords

degree contractibility problem; weighted degree contractibility problem

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

05C07: Vertex degrees