Characterizations of planar plick graphs

• Autorzy: V.R. Kulli , B. Basavanagoud
• Języki publikacji: EN

Abstrakty

EN

In this paper we present characterizations of graphs whose plick graphs are planar, outerplanar and minimally nonouterplanar.

Słowa kluczowe

EN

inner vertex number   planar graph   line graph   plick graph  

Kategorie tematyczne

• 05C10: Planar graphs; geometric and topological aspects of graph theory

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2004
• Tom: 24
• Numer: 1
• Strony: 41-45

Daty

wydano

2004

otrzymano

2001-03-12

poprawiono

2002-10-17

Twórcy

autor

V.R. Kulli

• Department of Mathematics, Gulbarga University, Gulbarga - 585 106, India

autor

B. Basavanagoud

• Department of Mathematics, Karnatak University, Dharwad - 580 003, India

Bibliografia

• [1] 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.
• [2] G. Chartrand and F. Harary, Planar permutation graphs, Ann. Inst. Henri Poincare Sec B. 3 (1967) 433.
• [3] F. Harary, Graph Theory (Addison - Wesley, Reading, Mass, 1969).
• [4] V.R. Kulli, On minimally nonouterplanar graphs, Proc. Indian Nat. Sci. Acad 41 (1975) 275-280.
• [5] V.R. Kulli and B. Basavanagoud, Traversability of Plick graphs, preprint.
• [6] 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.

Identyfikatory

DOI

10.7151/dmgt.1211