From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices

DOI10.4230/LIPICS.SOCG.2017.54zbMATH Open1436.05032OpenAlexW2730749296MaRDI QIDQ4580132FDOQ4580132

Authors: Alexander Pilz, Manuel Wettstein, Emo Welzl 

Publication date: 13 August 2018

Full work available at URL: http://dblp.uni-trier.de/db/conf/compgeom/compgeom2017.html#PilzWW17

Recommendations

• From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
• Crossing-free perfect matchings in wheel point sets
• Counting crossing-free structures
• Counting and enumerating crossing-free geometric graphs
• Counting and enumerating crossing-free geometric graphs

zbMATH Keywords

polytopegeometric graphGale transformsimplicial depthwheel set

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)

Cited In (6)

• The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs
• Arrangements of approaching pseudo-lines
• Computing colourful simplicial depth and Median in \(\mathbb{R}_2\)
• Crossing-free perfect matchings in wheel point sets
• Induced Ramsey-type results and binary predicates for point sets
• From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices

This page was built for publication: From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices

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