The thickness of a minor-excluded class of graphs

Discrete Mathematics

Volumn 182, Issue 1-3, 1998, Pages 169-176

  Jünger, Michael ^a   Mutzel, Petra ^b   Odenthal, Thomas ^a   Scharbrodt, Mark ^a  

^a UNIVERSITY OF COLOGNE   (Germany)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

1 sum; 2 sum; Crossing number; Graph minor; Skewness; Thickness; sum

Indexed keywords

EID: 0004535247     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(97)00146-5     Document Type: Article

References (7)

1. L.W. Beineke, R.J. Wilson (Eds.), Selected Topics in Graph Theory, Academic Press, London, 1978.
2. A.M. Dean, J.P. Hutchinson, E.R. Scheinerman, On the thickness and arboricity of a graph, J. Combin. Theory B 52 (1991) 147-151.
3. J. Halton, On the thickness of graphs of given degree, Inform. Sci. 54 (1991) 219-238.
4. J. Hopcroft, R.E. Tarjan, Efficient planarity testing, J. ACM 21 (1974) 549-568.
5. A. Mansfield, Determining the thickness of graphs is NP-hard, Math. Proc. Camb. Philos. Soc. 9 (1983) 9-23.
6. K. Truemper, Matroid Decomposition, Academic Press, Boston, 1992.
7. K. Wagner, Über eine Eigenschaft der ebenen Komplexe, Math. Ann. 114 (1937) 570-590.