Euler Complexes (Q2971605)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Euler Complexes	scientific article

Statements

scholarly article

0 references

Euler Complexes (English)

0 references

0 references

Research Trends in Combinatorial Optimization

0 references

publication date

7 April 2017

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-76796-1_4

0 references

Hamiltonian Cycles and Uniquely Edge Colourable Graphs

0 references

Combinatorial optimization. Theory and algorithms.

0 references

Combinatorial optimization. Polyhedra and efficiency (3 volumes)

0 references

On the complexity of the parity argument and other inefficient proofs of existence

0 references

Some graphic uses of an even number of odd nodes

0 references

Hard-to-Solve Bimatrix Games

0 references

Thomason's algorithm for finding a second Hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-540-76796-1_4

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2971605

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2971605&oldid=36314821"