Crossing number of abstract topological graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1547, Issue , 1999, Pages 238-245

  Kratochvíl, Jan ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 22444455149     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-37623-2_18     Document Type: Conference Paper

References (6)

1. M.R. Garey, D.S. Johnson: Crossing number is NP-complete, SIAM J. Algebraic and Discrete Methods 4 (1983), 312-316
2. M.C. Golumbic: Algorithmic Graph theory and Perfect Graphs, Academic Press, New York, 1980
3. J. Kratochvíl: String graphs II. Recognizing string graphs is NP-hard, J. Combin. Theory Ser. B 52 (1991), 67-78
4. J. Kratochvíl, A. Lubiw, J. Nešetřil: Noncrossing subgraphs of topological layouts, SIAM J. Discrete Math. 4 (1991), 223-244
5. J. Kratochvíl, J. Matoušek: String graphs requiring exponential representations, J. Combin. Theory Ser. B 53 (1991), 1-4
6. F. Sharokhi, O. Sýkora, I. Vrto: Crossing numbers of graphs, lower bound techniques and algorithms: a survey, in: Proc. Graph Drawing '94, LNCS 894, Springer Verlag, Berlin, 1995, pp. 131-142