Abstract
In this section we introduce an equivalence relation on the set of all orientations of a graph. The study of equivalence classes with respect to this relation turns out to play an important role in develo** algorithms for finding Pfaffian orientations of matching graphs which are known to be Pfaffian and in showing that the Pfaffian Recognition Problem (19.1) and the Pfaffian Orientation Problem (19.2) are both in co-NP and are polynomial-time equivalent.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Lucchesi, C.L., Murty, U.S.R. (2024). Similarity of Orientations and Characteristic Orientations. In: Perfect Matchings. Algorithms and Computation in Mathematics, vol 31. Springer, Cham. https://doi.org/10.1007/978-3-031-47504-7_20
Download citation
DOI: https://doi.org/10.1007/978-3-031-47504-7_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-47503-0
Online ISBN: 978-3-031-47504-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)