Euler Complexes
From MaRDI portal
Publication:2971605
DOI10.1007/978-3-540-76796-1_4zbMath1359.52016OpenAlexW4245623611MaRDI QIDQ2971605
Publication date: 7 April 2017
Published in: Research Trends in Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-76796-1_4
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Noncooperative games (91A10)
Related Items (5)
The maximum diameter of pure simplicial complexes and pseudo-manifolds ⋮ Exponentiality of the exchange algorithm for finding another room-partitioning ⋮ Unnamed Item ⋮ A PPA parity theorem about trees in a bipartite graph ⋮ Oriented Euler complexes and signed perfect matchings
Cites Work
- Some graphic uses of an even number of odd nodes
- On the complexity of the parity argument and other inefficient proofs of existence
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Hamiltonian Cycles and Uniquely Edge Colourable Graphs
- Hard-to-Solve Bimatrix Games
- Combinatorial optimization. Theory and algorithms.
- Thomason's algorithm for finding a second Hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs
This page was built for publication: Euler Complexes
