Tree-Residue Vertex-Breaking: a new tool for proving hardness

06/24/2017
by   Erik D. Demaine, et al.
0

In this paper, we introduce a new problem called Tree-Residue Vertex-Breaking (TRVB): given a multigraph G some of whose vertices are marked "breakable," is it possible to convert G into a tree via a sequence of "vertex-breaking" operations (disconnecting the edges at a degree-k breakable vertex by replacing that vertex with k degree-1 vertices)? We consider the special cases of TRVB with any combination of the following additional constraints: G must be planar, G must be a simple graph, the degree of every breakable vertex must belong to an allowed list B, and the degree of every unbreakable vertex must belong to an allowed list U. We fully characterize these variants of TRVB as polynomially solvable or NP-complete. The two results which we expect to be most generally applicable are that (1) TRVB is polynomially solvable when breakable vertices are restricted to have degree at most 3; and (2) for any k > 4, TRVB is NP-complete when the given multigraph is restricted to be planar and to consist entirely of degree-k breakable vertices. To demonstrate the use of TRVB, we give a simple proof of the known result that Hamiltonicity in max-degree-3 square grid graphs is NP-hard.

READ FULL TEXT
research
01/24/2023

Restricted optimal pebbling is NP-hard

Consider a distribution of pebbles on a graph. A pebbling move removes t...
research
01/13/2018

Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications

A Not-All-Equal (NAE) decomposition of a graph G is a decomposition of t...
research
02/28/2019

Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs

A connected component of a vertex-coloured graph is said to be colourful...
research
06/30/2017

Hamiltonicity is Hard in Thin or Polygonal Grid Graphs, but Easy in Thin Polygonal Grid Graphs

In 2007, Arkin et al. initiated a systematic study of the complexity of ...
research
06/09/2018

Acyclic orientations with degree constraints

In this note we study the complexity of some generalizations of the noti...
research
10/24/2017

Complexity of locally-injective homomorphisms to tournaments

For oriented graphs G and H, a homomorphism f: G → H is locally-injectiv...
research
04/08/2022

List covering of regular multigraphs

A graph covering projection, also known as a locally bijective homomorph...

Please sign up or login with your details

Forgot password? Click here to reset