Using results from extremal graph theory, we determine the asymptotic number of string graphs with n vertices, i.e., graphs that can be obtained as the intersection graph of a system of continuous arcs in the plane. The number becomes much smaller, for any fixed d, if we restrict our attention to systems of arcs, any two of which cross at most d times. As an application, we estimate the number of different drawings of the complete graph K n with n vertices under various side conditions.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
- How Many Ways Can One Draw a Graph?
- Springer Berlin Heidelberg
ec4u, Neuer Inhalt/© ITandMEDIA