The projective plane crossing numbers of circular graphs

The authors give an upper bound for the projective plane crossing number of a circular graph. Also, the authors prove the projective plane crossing numbers of circular graph C (8,3) and C (9,3) are 2 and 1, respectively.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of systems science and complexity 2008-02, Vol.21 (2), p.316-322
Hauptverfasser:	MA, Dengju, REN, Han
Format:	Artikel
Sprache:	eng
Schlagworte:	Complex Systems Control Mathematics Mathematics and Statistics Mathematics of Computing Operations Research/Decision Theory Statistics Systems Theory
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	The authors give an upper bound for the projective plane crossing number of a circular graph. Also, the authors prove the projective plane crossing numbers of circular graph C (8,3) and C (9,3) are 2 and 1, respectively.
ISSN:	1009-6124 1559-7067
DOI:	10.1007/s11424-008-9115-9