Keywords
- Bipartite Graph
- Base Number
- Dihedral Group
- Cycle Structure
- Permutation Graph
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
G. Chartrand and F. Harary, Planar permutation graphs, Ann. Inst. Henri Poincaré, Vol. IIIB (1967), 433–438.
S. Hedetniemi, On classes of graphs defined by special cutsets of lines, (this volume).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1969 Springer-Verlag
About this paper
Cite this paper
Frechen, J.B. (1969). On the number of cycles in permutation graphs. In: Chartrand, G., Kapoor, S.F. (eds) The Many Facets of Graph Theory. Lecture Notes in Mathematics, vol 110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0060108
Download citation
DOI: https://doi.org/10.1007/BFb0060108
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-04629-5
Online ISBN: 978-3-540-36161-9
eBook Packages: Springer Book Archive
