Hostname: page-component-7dd5485656-zklqj Total loading time: 0 Render date: 2025-10-31T13:43:21.203Z Has data issue: false hasContentIssue false
  • English
  • Français

Some remarks on fixing subgraphs and smoothly embeddable subgraphs

Published online by Cambridge University Press:  09 April 2009

Douglas D. Grant
Douglas D. Grant
Affiliation:
Department of Mathematics, University of Reading, England.
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.

In this note we specify the conditions under which the line graph of a fixing subgraph of a graph G is a smoothly embeddable subgraph of the line graph of G, and vice-versa.

Information

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 21 , Issue 1 , February 1976 , pp. 120 - 128
Copyright
Copyright © Australian Mathematical Society 1976

References

Behzad, M. and Chartrand, G. (1972), Introduction to the Theory of Graphs (Allyn and Bacon, Boston 1971).Google Scholar
Harary, F. (1969), Graph Theory (Addison-Wesley (Reading, Mass.), 1969).CrossRefGoogle Scholar
Sheehan, J. (1972 a), ‘Fixing Subgraphs’, J. Comb. Th. 12B, 226–244.CrossRefGoogle Scholar
Sheehan, J. (1972 b), ‘Smoothly Embeddable Subgraphs – A survey, in Combinatorics,’ Proc. Conference on Combinatorial Mathematics (The Institute of Mathematics and its Applications (Southend on Sea, Essex), 1972).Google Scholar
Sheehan, J. (1974). ‘Smoothly Embeddable Subgraphs,’ J. London Math. Soc. 9, 212–218.CrossRefGoogle Scholar
Whitney, M. (1932), ‘Congruent Graphs and the Connectivity of Graphs,’ Amer. J. Math. 54, 150–168.CrossRefGoogle Scholar