On a new graph invariant and a criterion for planarity
暂无分享,去创建一个
[1] H. Dym,et al. Further properties of discrete analytic functions , 1977 .
[2] W. B. Johnson,et al. Extensions of Lipschitz mappings into Hilbert space , 1984 .
[3] E. Szemerédi,et al. Unit distances in the Euclidean plane , 1984 .
[4] P. Mani. Automorphismen von polyedrischen Graphen , 1971 .
[5] Peter Braß,et al. The maximum number of second smallest distances in finite planar sets , 1992, Discret. Comput. Geom..
[6] Herbert Edelsbrunner,et al. A lower bound on the number of unit distances between the vertices of a convex polygon , 1991, J. Comb. Theory, Ser. A.
[7] A. J. Hoffman,et al. ON EIGENVALUES AND COLORINGS OF GRAPHS, II , 1970 .
[8] Katalin Vesztergombi,et al. On the distribution of distances in finite sets in the plane , 1985, Discret. Math..
[9] P. Erdös. On Sets of Distances of n Points , 1946 .
[10] P. Erdos,et al. COLLOQUIA MATHEMATICA SOCIETATIS JÁNOS BOLYAI 52 . COMBINATORICS , EGER ( HUNGARY , 2004 .
[11] R. J. Duffin,et al. Basic properties of discrete analytic functions , 1956 .
[12] Charles Delorme,et al. Laplacian eigenvalues and the maximum cut problem , 1993, Math. Program..
[13] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[14] L. Lovász,et al. Orthogonal representations and connectivity of graphs , 1989 .
[15] B. Mohar,et al. Eigenvalues and the max-cut problem , 1990 .
[16] Robin Thomas,et al. Hadwiger's conjecture forK6-free graphs , 1993, Comb..
[17] M. Simonovits,et al. ON THE CHROMATIC NUMBER OF GEOMETRIC GRAPHS , 1980 .
[18] Vojtech Rödl,et al. On embedding of graphs into euclidean spaces of small dimension , 1992, J. Comb. Theory, Ser. B.
[19] Richard James Duffin,et al. The Discrete Analogue of a Class of Entire Functions , 1968 .
[20] J. Bourgain. On lipschitz embedding of finite metric spaces in Hilbert space , 1985 .
[21] Oded Schramm. How to cage an egg , 1992 .
[22] László Lovász,et al. Rubber bands, convex embeddings and graph connectivity , 1988, Comb..
[23] P. Erdös,et al. On Some Applications of Graph Theory to Geometry , 1967, Canadian Journal of Mathematics.
[24] A. Hoffman. On graphs whose least eigenvalue exceeds − 1 − √2 , 1977 .
[25] P Erd,et al. On Sets of Distances of N Points in Euclidean Space , 2022 .
[26] László A. Székely,et al. Measurable chromatic number of geometric graphs and sets without some distances in euclidean space , 1984, Comb..
[27] Charles R. Johnson. The Theory of Matrices. Second Edition (with Applications) (Peter Lancaster and Miron Tismenetsky) , 1987 .
[28] Mark Jerrum,et al. Approximating the Permanent , 1989, SIAM J. Comput..
[29] Graham R. Brightwell,et al. Representations of Planar Graphs , 1993, SIAM J. Discret. Math..
[30] C. Nash-Williams,et al. Random walk and electric currents in networks , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.
[31] J. Kahn,et al. A counterexample to Borsuk's conjecture , 1993, math/9307229.
[32] Gary L. Miller,et al. Separators in two and three dimensions , 1990, STOC '90.
[33] Frank Thomson Leighton,et al. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[34] Oded Schramm,et al. Existence and uniqueness of packings with specified combinatorics , 1991 .
[35] I. Bárány,et al. On a common generalization of Borsuk's and Radon's theorem , 1979 .
[36] W. T. Tutte,et al. The Dissection of Rectangles Into Squares , 1940 .
[37] Paul D. Seymour,et al. Graph minors. III. Planar tree-width , 1984, J. Comb. Theory B.
[38] Walter Schnyder,et al. Embedding planar graphs on the grid , 1990, SODA '90.
[39] J. Reiterman,et al. Embeddings of graphs in euclidean spaces , 1989, Discret. Comput. Geom..
[40] Paul Erdös,et al. A colour problem for infinite graphs and a problem in the theory of relations , 1951 .
[41] John H. Reif,et al. Directed s-t Bumberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity , 1992, SODA.
[42] Yves Colin de Verdière,et al. Sur un nouvel invariant des graphes et un critère de planarité , 1990, J. Comb. Theory, Ser. B.
[43] Rajeev Motwani,et al. Constructive results from graph minors: linkless embeddings , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[44] Robin Thomas,et al. A survey of linkless embeddings , 1991, Graph Structure Theory.
[45] C. Rogers,et al. The realization of distances within sets in Euclidean space , 1972 .
[46] Doron Zeilberger,et al. A new basis for discrete analytic polynomials , 1977, Journal of the Australian Mathematical Society.
[47] Paul Erdös,et al. On the graph of large distances , 1989 .
[48] H. Eggleston. Covering a Three‐Dimensional set with Sets of Smaller Diameter , 1955 .
[49] Peter G. Doyle,et al. Random Walks and Electric Networks: REFERENCES , 1987 .
[50] A. Recski. Matroid theory and its applications in electric network theory and in statics , 1989 .
[51] Doron Zeilberger. A new approach to the theory of discrete analytic functions , 1977 .
[52] R. J. Duffin,et al. Potential theory on a rhombic lattice , 1968 .