Checking the admissibility of odd-vertex pairings is hard

02/27/2021
by   Florian Hörsch, et al.
0

Nash-Williams proved that every graph has a well-balanced orientation. A key ingredient in his proof is admissible odd-vertex pairings. We show that for two slightly different definitions of admissible odd-vertex pairings, deciding whether a given odd-vertex pairing is admissible is co-NP-complete. This resolves a question of Frank. We also show that deciding whether a given graph has an orientation that satisfies arbitrary local arc-connectivity requirements is NP-complete.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/28/2022

On the complexity of finding well-balanced orientations with upper bounds on the out-degrees

We show that the problem of deciding whether a given graph G has a well-...
research
10/29/2018

On the End-Vertex Problem of Graph Searches

End vertices of graph searches can exhibit strong structural properties ...
research
01/24/2023

Restricted optimal pebbling is NP-hard

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

Graph Homomorphism Reconfiguration and Frozen H-Colourings

For a fixed graph H, the reconfiguration problem for H-colourings (i.e. ...
research
12/16/2021

Deciding twin-width at most 4 is NP-complete

We show that determining if an n-vertex graph has twin-width at most 4 i...
research
12/14/2021

A note on 2-vertex-connected orientations

We consider two possible extensions of a theorem of Thomassen characteri...
research
03/30/2021

Determining a Slater Winner is Complete for Parallel Access to NP

We consider the complexity of deciding the winner of an election under t...

Please sign up or login with your details

Forgot password? Click here to reset