Checking the admissibility of odd-vertex pairings is hard

DOI10.1016/j.dam.2022.04.004OpenAlexW3133747404MaRDI QIDQ2142685

Florian Hoersch

Publication date: 27 May 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.00306

zbMATH Keywords

connectivityorientation

Mathematics Subject Classification ID

Computer science (68-XX) Information and communication theory, circuits (94-XX)

Related Items (1)

Complexity of (arc)-connectivity problems involving arc-reversals or deorientations

Cites Work

• Recent results on well-balanced orientations
• Simultaneous well-balanced orientations of graphs
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Checking the admissibility of odd-vertex pairings is hard