ArticleOriginal scientific text
Title
Characterizations of planar plick graphs
Authors 1, 2
Affiliations
- Department of Mathematics, Gulbarga University, Gulbarga - 585 106, India
- Department of Mathematics, Karnatak University, Dharwad - 580 003, India
Abstract
In this paper we present characterizations of graphs whose plick graphs are planar, outerplanar and minimally nonouterplanar.
Keywords
inner vertex number, planar graph, line graph, plick graph
Bibliography
- G. Chartrand, D. Geller and S. Hedetniemi, Graphs with forbidden subgraphs, J. Combin. Theory 10 (1971) 12-41, doi: 10.1016/0095-8956(71)90065-7.
- G. Chartrand and F. Harary, Planar permutation graphs, Ann. Inst. Henri Poincare Sec B. 3 (1967) 433.
- F. Harary, Graph Theory (Addison - Wesley, Reading, Mass, 1969).
- V.R. Kulli, On minimally nonouterplanar graphs, Proc. Indian Nat. Sci. Acad 41 (1975) 275-280.
- V.R. Kulli and B. Basavanagoud, Traversability of Plick graphs, preprint.
- J. Sedlácek, Some properties of interchange graphs, in: Theory of graphs and its applications, M. Fiedler, ed. (Academic Press, New York, 1962) 145-150.