An orientation theorem with parity conditions
From MaRDI portal
Publication:5954236
DOI10.1016/S0166-218X(01)00213-XzbMath0989.05029MaRDI QIDQ5954236
Zoltán Szigeti, András Frank, Tibor Jordán
Publication date: 2001
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)
Related Items (7)
Bernoulli trials of fixed parity, random and randomly oriented graphs ⋮ Compatible Geometric Matchings ⋮ A Survey on Covering Supermodular Functions ⋮ Compatible geometric matchings ⋮ The parity problem of polymatroids without double circuits ⋮ A note on parity constrained orientations ⋮ The edge-orientation problem and some of its variants on weighted graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to determine the maximum genus of a graph
- Perfect matchings of a graph
- On the maximum genus of a graph
- Edge-Disjoint Spanning Trees of Finite Graphs
- Odd Rooted Orientations and Upper-Embeddable Graphs
- A new characterization of the maximum genus of a graph
- A Characterization in of Upper-Embeddable Graphs
- Survey of results on the maximum genus of a graph
This page was built for publication: An orientation theorem with parity conditions
