Note about the complexity of the acyclic orientation with parity constraint problem

DOI10.1016/J.DAM.2026.03.013MaRDI QIDQ7262695zbMATH OpenFDO

Authors Sylvain Gravier, Matthieu Petiteau, Isabelle Sivignon

Publication date 12 June 2026

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

Full work available at URL https://doi.org/10.1016/J.DAM.2026.03.013

zbMATH Keywords

acyclic orientationparity orientationplanar graph

Mathematics Subject Classification ID

Combinatorics (05-XX) Graph theory (05Cxx) Theory of computing (68Qxx)

Cites work

• Graph orientations with edge-connection and parity constraints
• Graphs on surfaces
• scientific article; zbMATH DE number 5042863 (Why is no real title available?)
• Odd Rooted Orientations and Upper-Embeddable Graphs
• Planar Formulae and Their Uses
• Symplectic spaces and ear-decomposition of matroids

This page was built for publication: Note about the complexity of the acyclic orientation with parity constraint problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7262695)