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
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

10/29/2018

On the End-Vertex Problem of Graph Searches

End vertices of graph searches can exhibit strong structural properties ...
11/23/2017

Vertex partitions of (C_3,C_4,C_6)-free planar graphs

A graph is (k_1,k_2)-colorable if its vertex set can be partitioned into...
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...
12/01/2017

Graph Homomorphism Reconfiguration and Frozen H-Colourings

For a fixed graph H, the reconfiguration problem for H-colourings (i.e. ...
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...
01/30/2018

Combinatorial Characterisations of Graphical Computational Search Problems

A Graphical Search problem, denoted Π(X,γ), where X is the vertex set or...
09/27/2017

Surjective H-Colouring over Reflexive Digraphs

The Surjective H-Colouring problem is to test if a given graph allows a ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.