The odd-even invariant and Hamiltonian circuits in tope graphs

DOI10.1016/j.ejc.2017.10.002zbMath1376.05080arXiv1610.05039OpenAlexW2963013229WikidataQ91635841 ScholiaQ91635841MaRDI QIDQ1686251

Yvonne Kemper, James F. Lawrence

Publication date: 21 December 2017

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.05039

zbMATH Keywords

tope graphscentral arrangements

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The odd-even invariant for graphs
• On the number of triangles in simple arrangements of pseudolines in the real projective plane
• Simplicial cells in arrangements and mutations of oriented matroids
• Two-coloring the faces of arrangements
• Two-colouring inequalities for euclidean arrangements in general position
• The ratio of black and white polygons of a map generated by general straight lines
• Straight line arrangements in the real projective plane
• Gray codes for reflection groups
• The odd--even invariant of an oriented matroid
• On simple arrangements of lines and pseudo-lines in P^2 and R^2 with the maximum number of triangles
• Arrangements of Lines with a Large Number of Triangles
• A Two-Coloring Inequality for Euclidean Two-Arrangements
• Shorter Notes: A Quadrilateral-Free Arrangement of Sixteen Lines

This page was built for publication: The odd-even invariant and Hamiltonian circuits in tope graphs