Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-11-28T06:38:10.706Z Has data issue: false hasContentIssue false
  • English
  • Français

The relationship between fixing subgraphs and smoothly embeddable subgraphs

Part of: Graph theory

Published online by Cambridge University Press:  09 April 2009

Keith Chidzey
Keith Chidzey
Affiliation:
Department of Mathematics University of Melbourne Parkville, Victoria 3052 Australia
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Grant (1976) has attempted to establish a relationship between fixing subgraphs and smoothly embeddable subgraphs. Here we give counterexamples to his two main lemmas and two characterizing theorems. We then go on to give our own version of these lemmas and theorems.

MSC classification

Secondary: 05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 26 , Issue 3 , November 1978 , pp. 353 - 367
Copyright
Copyright © Australian Mathematical Society 1978

References

Behzad, M. and Chartrand, G. (1971), Introduction to the theory of graphs (Allyn and Bacon, Boston).Google Scholar
Grant, D. D. (1976), ‘Some remarks on fixing subgraphs and smoothly embeddable subgraphs’, J. Austral. Math. Soc. (Ser. A) 21, 120–128.CrossRefGoogle Scholar
Sheehan, J. (1972a), ‘Fixing subgraphs’, J. Comb. Th. (Ser. B) 12, 226–244.Google Scholar
Sheehan, J. (1972b), ‘Smoothly embeddable subgraphs—A survey, Combinatorics’, Proc. Conf. Comb. Math. (I.M.A., Southend-on-Sea, Essex).Google Scholar
Sheehan, J. (1974), ‘Smoothly embeddable subgraphs’, J. London Math. Soc. 9, 212–218.CrossRefGoogle Scholar
Whitney, H. (1932), ‘Congruent graphs and the connectivity of graphs’, Amer. J. Math. 54, 150–168.CrossRefGoogle Scholar