Computing the girth of a planar graph

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1853, Issue , 2000, Pages 821-831

  Djidjev, Hristo N ^a  

^a UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; GRAPHIC METHODS;

AS GRAPH; DYNAMIC SHORTEST PATH; GRAPH G; PLANAR GRAPH; SHORTEST CYCLE; TREE-WIDTH;

TREES (MATHEMATICS);

EID: 84974559936     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_69     Document Type: Conference Paper

References (23)

1. Alon, Yuster and Zwick. Color-coding. Journal of the ACM, 42:844-856, 1995.
2. Alon, Yuster and Zwick. Finding and counting given length cycles. Algorithmica, 17:209-223, 1997.
3. Brenda S. Baker. Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM, 41(1):153-180, January 1994.
4. Béla Bollobás. Chromatic number, girth and maximal degree. Discrete Mathematics., 24:311-314, 1978.
5. R. J. Cook. Chromatic number and girth. Periodica Mathcmatica Hungarica, 6(1):103-107, 1975.
6. Reinhard Diestel. Graph Theory. Springer-Verlag, Berlin, Heidelberg, New York, Tokio, 1997.
7. H. Djidjev, G. Pantziou, and C. Zaroliagis. Improved algorithms for dynamic shortest paths. Algorithmica, 1999. To appear.
8. Hristo N. Djidjev. A separator theorem. Compt. rend. Acad. bulg. Sci., 34:643-645, 1981.
9. Hristo N. Djidjev. On the problem of partitioning planar graphs. SIAM Journal on Algebraic and Discrete Methods, 3:229-240, 1982.
10. Hristo N. Djidjev. A linear algorithm for partitioning graphs of fixed genus. Serdica, 11:329-341, 1985.
11. David Eppstein. Subgraph isomorphism for planar graphs and related problems. In Proc. 6th Symp. Discrete Algorithms, pages 632-640. Assoc. Comput. Mach. and Soc. Industrial & Applied Math., 1995.
12. Paul Erdös. Graph theory and probability. Canad. J. Math., 11:34-38, 1959.
13. G.N. Frederickson. Planar graph decomposition and all pairs shortest paths. Journal of the ACM, 38:162-204, 1991.
14. John R. Gilbert, Joan P. Hutchinson, and Robert E. Tarjan. A separator theorem for graphs of bounded genus. J. Algorithms, 5:391-407, 1984.
15. F. Harary. Graph Theory. Addison-Wesley, Reading, Massachusetts, 1969.
16. A. Itai and M. Rodeh. Finding a minimum circuit in a graph. SIAM J. Computing, 7:413-423, 1978.
17. P. Klein, S. Rao, M. Rauch, and S. Subramanian. Faster shortest-path algorithms for planar graphs. In 26th ACM Symp. Theory of Computing, pages 27-37, 1994.
18. Richard J. Lipton and Robert E. Tarjan. A separator theorem for planar graphs. SIAM J. Appl. Math, 36:177-189, 1979.
19. L. Lovasz. On chromatic number of finite set systems. Acta Math. Acad. Sci. Hun., 19:59-67, 1968.
20. Wolfgang Mader. Topological subgraphs in graphs of large girth. Combinatorica, 18:405, 1998.
21. B. Monien. The complexity of determining a shortest cycle of even length. Computing, 31:355-369, 1983.
22. Carsten Thomassen. Paths, circuits and subdivisions. In Selected Topics in Graph Theory, ed. Lowell W. Beineke and Robin J. Wilson, Academic Press, volume 3. 1988.
23. Vazirani and Yannakakis. Pfaflian orientations, 0-1 permanents, and even cycles in directed graphs. DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science, 25, 1989.