s-homotopy for finite graphs

DOI10.1016/j.endm.2008.06.025zbMath1267.05074OpenAlexW2078388567MaRDI QIDQ5300995

Bertrand Jouve, Etienne Fieux, Romain Boulet

Publication date: 28 June 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2008.06.025

zbMATH Keywords

posetsgraphscollapsibilitybarycentric subdivisiondismantlabilitysimple homotopy

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

Simplicial simple-homotopy of flag complexes in terms of graphs

Cites Work

• Unnamed Item
• Representation of smooth surfaces by graphs. Transformations of graphs which do not change the Euler characteristic of graphs
• Dismantlable graphs and posets, fixed clique property
• Dismantlability Revisited for Ordered Sets and Graphs and the Fixed-Clique Property
• Graph homotopy and Graham homotopy

This page was built for publication: s-homotopy for finite graphs