Abstract
The coarseness ξ(G) of a graph G is the maximum number of mutually line-disjoint nonplanar subgraphs of G. Clearly, ξ(G) = 1 if and only if G is nonplanar and G has no two line-disjoint subgraphs homeomorphic to K 3,3 or K 5. In this paper, we obtain a necessary and sufficient condition for plick graph P n(G); n ≥ 1 to have coarseness number one.
Similar content being viewed by others
References
Basavanagoud, B.: A study in the theory of graphs. Ph.D Thesis, Gulbarga University, Gulbarga (1991)
Basavanagoud B., Kulli V.R.: Hamiltonian and eulerian properties of plick graphs. Math. Student 73(1-4), 175–181 (2004)
Beineke L.W., Chartrand G.: The coarseness of a graph. Compositio Math. 19, 290–298 (1969)
Harary F.: Graph Theory. Addison-Wesley Publishing Co., Reading (1969)
Kulli V.R., Basavanagoud B.: Characeterizations of planar plick graphs. Disc. Math. Graph Theory 24, 41–45 (2004)
Kulli, V.R.: The plick graph of a graph. Abs. Graph Theory Newslett. 15 (1986)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bommanahal, B., Mirajkar, K.G. On Plick Graphs with Coarseness Number One. Math.Comput.Sci. 5, 7–10 (2011). https://doi.org/10.1007/s11786-011-0079-0
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11786-011-0079-0