Article contents
The Tutte Polynomial Characterizes Simple Outerplanar Graphs
Published online by Cambridge University Press: 09 March 2011
Abstract
We show that if G is a simple outerplanar graph and H is a graph with the same Tutte polynomial as G, then H is also outerplanar. Examples show that the condition of G being simple cannot be omitted.
- Type
- Paper
- Information
- Copyright
- Copyright © Cambridge University Press 2011
References
[1]Bodirsky, M., Giménez, O., Kang, M. and Noy, M. (2007) Enumeration and limit laws for series-parallel graphs. Europ. J. Combin. 28 2091–2105.CrossRefGoogle Scholar
[2]Brylawski, T. H. (1971) A combinatorial model for series-parallel networks. Trans. Amer. Math. Soc. 154 1–22.Google Scholar
[3]Brylawski, T. H. (1972) A decomposition for combinatorial geometries. Trans. Amer. Math. Soc. 171 235–282.CrossRefGoogle Scholar
[4]Brylawski, T. and Oxley, J. (1992) The Tutte polynomial and its applications. In Matroid Applications (White, N., ed.), Vol. 40 of Encyclopedia of Mathematics and its Applications, Cambridge University Press, pp. 123–225.CrossRefGoogle Scholar
[5]Chartrand, G. and Harary, F. (1967) Planar permutation graphs. Ann. Inst. H. Poincaré Sect. B (NS) 3 433–438.Google Scholar
[6]Dirac, G. A. (1952) A property of 4-chromatic graphs and some remarks on critical graphs. J. London Math. Soc. 27 85–92.CrossRefGoogle Scholar
[7]Eppstein, D. (1992) Parallel recognition of series-parallel graphs. Inform. Comput. 98 41–55.CrossRefGoogle Scholar
[8]Merino, C., de Mier, A. and Noy, M. (2001) Irreducibility of the Tutte polynomial of a connected matroid. J. Combin. Theory Ser. B 83 298–304.CrossRefGoogle Scholar
[9]de Mier, A. (2003) Graphs and matroids determined by their Tutte polynomials. PhD thesis, Universitat Politècnica de Catalunya.Google Scholar
[10]de Mier, A. and Noy, M. (2005) On matroids determined by their Tutte polynomials. Discrete Math. 302 52–76.CrossRefGoogle Scholar
[11]Schwärzler, W. (1991) Being Hamiltonian is not a Tutte invariant. Discrete Math. 91 87–89.CrossRefGoogle Scholar
[12]Whitney, H. (1932) Non-separable and planar graphs. Trans. Amer. Math. Soc. 34 339–362.CrossRefGoogle Scholar
- 1
- Cited by