Outerplanar crossing numbers of 3-row meshes, halin graphs and complete p-partite graphs

Lecture Notes in Computer Science

Volumn 3381, Issue , 2005, Pages 376-379

  Fulek, Radoslav ^a   He, Hongmei ^b   Sýkora, Ondrej ^b   Vrťo, Imrich ^c  

^a Faculty of Natural Sciences   (Slovakia)

^b LOUGHBOROUGH UNIVERSITY   (United Kingdom)

^c INSTITUTE OF CHEMISTRY   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS;

HALIN GRAPHS; N-VERTEX GRAPH; P-PARTITE GRAHS;

GRAPH THEORY;

EID: 24144498655     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30577-4_43     Document Type: Conference Paper

References (5)

1. Kainen, P.C., The book thickness of a graph II, Congressus Numerantium, 71 (1990), 121-132.
2. Masuda, S., Kashiwabara, T., Nakajima, K., Fujisawa, T., On the NP-completeness of a computer network layout problem, in: Proc. IEEE Intl. Symposium on Circuits and Systems 1987, IEEE Computer Society Press, Los Alamitos 1987, 292-295.
3. m,n, Bulletin ICA 39 (2003), 7-15.
4. Shahrokhi, F., Sýkora, O., Székely, L.A., Vrťo, I., Crossing numbers: bounds and applications, in: Intuitive Geometry, Bolyai Society Mathematical Studies 6, (I. Bárány and K. Böröczky, eds.), Akadémia Kiadó, Budapest 1997, 179-206.
5. Shahrokhi, F., Sýkora, O., Székely, L.A., Vrťo, I., The book crossing number of graphs, J. Graph Theory, 21 (1996), 413-424.