Euler complexes (oiks)

MaRDI QIDQ2861567zbMATH OpenFDO

Authors Jack Edmonds

Publication date 8 November 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065310001642

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Noncooperative games (91A10)

Recommendations

• Euler complexes
• Sperner oiks
• Hard-to-Solve Bimatrix Games
• Oriented Euler complexes and signed perfect matchings
• scientific article; zbMATH DE number 3847256

Cites work

• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Equilibrium Points of Bimatrix Games
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• scientific article; zbMATH DE number 3223483 (Why is no real title available?)
• Lemke Paths on Simple Polytopes
• Some graphic uses of an even number of odd nodes
• Thomason's algorithm for finding a second Hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs

Cited in

(5)

• Oriented Euler complexes and signed perfect matchings
• Finding Gale strings
• Sperner oiks
• Euler complexes
• Simplicial complexes defined on groups

This page was built for publication: Euler complexes (oiks)

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