Homology as a Tool in Integer Programming

DOI10.1137/0606063MaRDI QIDQ3714903zbMATH OpenOpenAlexFDO

Authors Saul Stahl

Publication date 1985

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0606063

zbMATH Keywords

bounds on the solutionsgraph coloring techniqueshomology theory

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Fixed points and coincidences in algebraic topology (55M20) Integer programming (90C10)

Recommendations

• Complexes of graph homomorphisms
• Homology tests for graph colorings
• Rational homotopy theory for computing colorability of simplicial complexes
• Integer programming models for colorings of mixed hypergraphs

Cites work

• From graphs to ortholattices and equivariant maps
• Kneser's conjecture, chromatic number, and homotopy
• n-tuple colorings and associated graphs
• Reductions of n-Fold Covers

Cited in

(3)

• Homotopy techniques in linear programming
• Quantum walks: Schur functions meet symmetry protected topological phases
• Extending the Notion of AT-Model for Integer Homology Computation

This page was built for publication: Homology as a Tool in Integer Programming

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