On the Number of Simple Cycles in Planar Graphs

Combinatorics Probability and Computing

Volumn 8, Issue 5, 1999, Pages 397-405

  Alt, Helmut ^a   Fuchs, Ulrich ^b   Kriegel, Klaus ^a  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033269707     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548399003995     Document Type: Article

References (8)

1. Blum, M. and Hewitt, C. (1967) Automata on a 2-dimensional tape. In 8th IEEE Conf. on SWAT, pp. 155-160.
2. Ding, G. (1996) Bounding the number of circuits of a graph. Combinatorica 16 331-341.
3. Eppstein, D. (1997) Personal communication.
4. Fößmeier, U. and Kaufmann, M. (1996) On exact solutions for the rectilinear Steiner problem, Part I: Theoretical results. Technical Report WSI-96-09, Computer Science Institute, Universität Tübingen.
5. Fößmeier, U. and Kaufmann, M. (1997) Solving rectilinear Steiner tree problems exactly in theory and practice. In Proc. ESA'97, Vol. 1284 of LNCS, Springer, pp. 171-185.
6. Heawood, P. J. (1890) Map color theorem. Quart. J. Pure Appl. Math. 24 332-338.
7. Jensen, T. R. and Toft, B. (1995) Graph Coloring Problems, Wiley, New York.
8. Steinberg, R. (1993) The state of the three color problem. Ann. Discrete Math. 55 211-248.