Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L.W. Beineke, F. Harary, J.W. Moon, On the thickness of the complete bipartite graph, Proc. Cambridge Phil. Soc. 60 (1964) 1–5.
A. Errera, Un Théoreme sur les Liaisons, C.R. Acad. Sci. Paris 177 (1923) 489–491.
P.W. Kasteleyn, Graph theory and crystal physics, in Graph Theory and Theoretical Physics, pp. 43–110 (Academic Press, New York, 1967).
C.H.C. Little, D.J. Thuente, Complete bipartite graphs and the Hadamard conjecture, Proc. Tenth Southeastern Conference on Combinatorics, Graph Theory and Computing, 1979, 721–726.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag
About this paper
Cite this paper
Little, C.H.C. (1982). An interesting decomposition of k4n,4n into planar subgraphs. In: Billington, E.J., Oates-Williams, S., Street, A.P. (eds) Combinatorial Mathematics IX. Lecture Notes in Mathematics, vol 952. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0061989
Download citation
DOI: https://doi.org/10.1007/BFb0061989
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11601-1
Online ISBN: 978-3-540-39375-7
eBook Packages: Springer Book Archive