Characterization of level non-planar graphs by minimal patterns

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

Volumn 1858, Issue , 2000, Pages 74-84

  Healy, Patrick ^a   Kuusik, Ago ^a   Leipert, Sebastian ^b  

^a UNIVERSITY OF LIMERICK   (Ireland)

^b UNIVERSITY OF COLOGNE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

FORBIDDEN SUBGRAPHS; NON-PLANAR GRAPHS; NP-HARD; PLANAR GRAPH; PLANARIZATION; SUBGRAPHS;

GRAPHIC METHODS;

EID: 84957016109     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44968-x_8     Document Type: Conference Paper

References (6)

1. G. Di Battista and E. Nardelli. Hierarchies and planarity theory. IEEE Transactions on Systems, Man, and Cybernetics, 18(6): 1035-1046, 1988.
2. P. Eades, B. D. McKay, and N. C. Wormald. On an edge crossing problem. In Proc. 9th Australian Computer Science Conference, pages 327-334. Australian National University, 1986.
3. P. Eades and S. Whitesides. Drawing graphs in two layers. Theoretical Computer Science, 131: 361-374, 1994.
4. F. Harary. Graph Theory. Addison-Wesley, 1969.
5. M. Jünger, S. Leipert, and P. Mutzel. Level planarity testing in linear time. Technical Report 98.321, Institut für Informatik, Universität zu Köln, 1998.
6. P. Mutzel. An alternative method to crossing minimization on hierarchical graphs. In Stephen North, editor, Graph Drawing. Symposium on Graph Drawing, GD '96, volume 1190 of Lecture Notes in Computer Science, pages 318-333. Springer-Verlag, 1996.