On Plick Graphs with Coarseness Number One

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematics in computer science 2011-03, Vol.5 (1), p.7-10
Hauptverfasser: Bommanahal, Basavanagoud, Mirajkar, Keerthi G.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1661-8270
1661-8289
DOI:10.1007/s11786-011-0079-0