Abstract
The twisted graph T n is a complete topological graph with n vertices v 1,v 2,...,v n in which two edges v i v j (i < j) and v s v t (s < t) cross each other if and only if i < s < t < j or s < i < j < t. We study several properties concerning plane topological subgraphs of T n. © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
APA
Omaña-Pulido, E., & Rivera-Campo, E. (2012). Notes on the twisted graph. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7579 LNCS, pp. 119–125). https://doi.org/10.1007/978-3-642-34191-5_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free