Combinatorics and geometry of finite and infinite squaregraphs

SIAM Journal on Discrete Mathematics

Volumn 24, Issue 4, 2010, Pages 1399-1440

  Bandelt, Hans Jürgen ^a   Chepoi, Victor ^b   Eppstein, David ^c  

^a UNIVERSITY OF HAMBURG   (Germany)

^b AIX MARSEILLE UNIVERSITY   (France)

^c Irvine   (United States)

Author keywords

Circular split system; Isometric embedding; Median graph; Plane graph; Tree

Indexed keywords

FORESTRY; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION;

CIRCULAR SPLIT SYSTEM; ISOMETRIC EMBEDDINGS; MEDIAN GRAPH; PLANE GRAPHS; TREE;

GRAPH THEORY;

EID: 79251548577     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/090760301     Document Type: Article

References (61)

1. A. A. AGEEV, A triangle-free circle graph with chromatic number 5, Discrete Math., 152(1996), pp. 295-298.
2. A. A. AGEEV, Every circle graph of girth at least 5 is 3-colourable, Discrete Math., 195(1999), pp. 229-233.
3. H.-J. BANDELT, Retracts of hypercubes, J. Graph Theory, 8(1984), pp. 501-510.
4. H.-J. BANDELT, Networks with Condorcet solutions, European J. Oper. Res., 20(1985), pp. 314-326.
5. 1-Statistical Analysis and Related Methods, Institute of Mathematical Statistics, Lecture Notes-Monograph Series 31, Y. Dodge, ed., Elsevier/North-Holland, Amsterdam, 1992, pp. 305-309.
6. H.-J. BANDELT AND V. CHEPOI, Cellular bipartite graphs, European J. Combin., 17(1996), pp. 121-134.
7. H.-J. BANDELT AND V. CHEPOI, Graphs of acyclic cubical complexes, European J. Combin., 17(1996), pp. 113-120.
8. 1- embedding of weakly median graphs, European J. Combin., 21(2000), pp. 701-714.
9. H.-J. BANDELT AND V. CHEPOI, Metric graph theory and geometry: A survey, in Surveys on Discrete and Computational Geometry: Twenty Years Later, Contemp. Math. 453, J. E. Goodman, J. Pach, and R. Pollack, eds., AMS, Providence, RI, 2008, pp. 49-86.
10. H.-J. BANDELT, V. CHEPOI, AND D. EPPSTEIN, Ramified Rectilinear Polygons: Coordinatization by Dendrons, preprint, http://arxiv.org/abs/1005.1721, 2010.
11. H.-J. BANDELT AND A. DRESS, Reconstructing the shape of a tree from observed dissimilarity data, Adv. in Appl. Math., 7(1986), pp. 309-343.
12. H.-J. BANDELT AND A. DRESS, A canonical decomposition theory for metrics on a finite set, Adv. Math., 92(1992), pp. 47-105.
13. H.-J. BANDELT AND J. HEDLÍKOVÁ, Median algebras, Discrete Math., 45(1983), pp. 1-30.
14. H.-J. BANDELT, V. MACAULAY, AND M. RICHARDS, Median networks: Speedy construction and greedy reduction, one simulation, and two case studies from human mtDNA, Mol. Phylogen. Evol., 16(2000), pp. 8-28.
15. H.-J. BANDELT AND M. VAN DE VEL, Embedding topological median algebras in products of dendrons, Proc. London Math. Soc. (3), 58(1989), pp. 439-453.
16. J. P. BARTHÉLEMY, From copair hypergraphs to median graphs with latent vertices, Discrete Math., 76(1989), pp. 9-28.
17. C. BERGE, Hypergraphs: Combinatorics of Finite Sets, Elsevier, Amsterdam, 1989.
18. C. BERGE AND P. DUCHET, A generalization of Gilmore's theorem, in Recent Advances in Graph Theory, M. Fiedler, ed., Acad. Praha, Prague, 1975, pp. 49-55.
19. G. BERGMAN, On the existence of subalgebras of direct products with prescribed d-fold projections, Algebra Universalis, 7(1977), pp. 341-356.
20. G. BIRKHOFF AND S. A. KISS, A ternary operation in distributive lattices, Bull. Amer. Math. Soc., 52(1947), pp. 749-752.
21. A. BJÖRNER, M. las VERGNAS, B. STURMFELS, N. WHITE, AND G. ZIEGLER, Oriented Matroids, Encyclopedia of Mathematics and Its Applications 46, Cambridge University Press, Cambridge, UK, 1993.
22. B. BREŠAR, S. KLAVŽAR, AND R. ŠKREKOVSKI, On cube-free median graphs, Discrete Math., 307(2007), pp. 345-351.
23. M. BRIDSON AND A. HAEFLIGER, Metric Spaces of Non-Positive Curvature, Springer-Verlag, New York, 1999.
24. I. CHATTERJI, C. DRUŢU, AND F. HAGLUND, Kazhdan and Haagerup properties from the median viewpoint, Adv. Math., 225(2010), pp. 882-921.
25. V. CHEPOI, On distances in benzenoid systems, J. Chem. Inf. Comput. Sci., 36(1996), pp. 1169-1172.
26. V. CHEPOI, Graphs of some CAT (0) complexes, Adv. in Appl. Math., 24(2000), pp. 125-179.
27. V. CHEPOI, F. DRAGAN, AND Y. VAXÈS, Center and diameter problem in planar quadrangulations and triangulations, in Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), ACM, New York, SIAM, Philadelphia, 2002, pp. 346-355.
28. V. CHEPOI, F. DRAGAN, AND Y. VAXÈS, Distance and routing labeling schemes for nonpositively curved plane graphs, J. Algorithms, 61(2006), pp. 1-31.
29. V. CHEPOI, C. FANCIULLINI, AND Y. VAXÈS, Median problem in some plane triangulations and quadrangulations, Comput. Geom., 27(2004), pp. 193-210.
30. V. CHEPOI, T. FÉVAT, E. GODARD, AND Y. VAXÈS, A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives, in Proceedings of the 14th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2007), Lecture Notes in Comput. Sci. 4474, Springer-Verlag, Berlin, 2007, pp. 81-95.
31. V. CHEPOI AND S. KLAVŽAR, The Wiener index and the Szeged index of benzenoid systems in linear time, J. Chem. Inf. Comput. Sci., 37(1997), pp. 752-755.
32. Z. DJOKOVIĆ, Distance-preserving subgraphs of hypercubes, J. Combin. Theory Ser. B, 14(1973), pp. 263-267.
33. A. DRESS, K. T. HUBER, AND V. MOULTON, Some variations on a theme by Buneman, Ann. Combin., 1(1997), pp. 339-352.
34. A. DRESS, J. KOOLEN, AND V. MOULTON, 4n - 10, Ann. Combin., 8(2004), pp. 463-471.
35. A. DRESS AND R. SCHARLAU, Gated sets in metric spaces, Aequationes Math., 34(1987), pp. 112-120.
36. D. EPPSTEIN, Arboricity and bipartite subgraph listing algorithms, Inform. Process. Lett., 51(1994), pp. 207-211.
37. D. EPPSTEIN, The lattice dimension of a graph, European J. Combin., 26(2005), pp. 585-592.
38. D. EPPSTEIN, Manhattan orbifolds, Topol. Appl., 157(2010), pp. 494-507.
39. D. EPPSTEIN, J.-CL. FALMAGNE, AND S. OVCHINNIKOV, Media Theory, Springer-Verlag, New York, 2007.
40. D. EPPSTEIN AND K. WORTMAN, Optimal Angular Resolution for Face-Symmetric Drawings, manuscript, 2009.
41. E. EVANS, Median lattices and convex subalgebras, in Universal Algebra (Esztergom, 1977), Colloq. Math. Soc. János Bolyai 29, North-Holland, Amsterdam, 1982, pp. 225-240.
42. S. W. GOLOMB, Polyominoes, Charles Scribner's Sons, New York, 1965.
43. D. GURALNIK, Coarse Decompositions of Boundaries for CAT (0) Groups, preprint, http://arxiv.org/abs/math/0611006, 2007.
44. F. HAGLUND AND F. PAULIN, Simplicité de groupes d'automorphismes d'espaces à courbure négative, in The Epstein Birthday Schrift, Geom. Topol. Monogr. 1, C. Rourke, I. Rivin, and C. Series, eds., Geom. Topol. Publ., Coventry, UK, 1998, pp. 181-248.
45. E. V. HUNTINGTON, A set of independent postulates for cyclic order, Proc. Natl. Acad. Sci. USA, 2(1916), pp. 630-631.
46. J. R. ISBELL, Median algebra, Trans. Amer. Math. Soc., 260(1980), pp. 319-362.
47. T. R. JENSEN AND B. TOFT, Graph Coloring Problems, Wiley Interscience, New York, 1995.
48. S. KLAVŽAR AND M. KOVŠE, Induced cycles in crossing graphs of median graphs, Discrete Math., 309(2009), pp. 6585-6589.
49. A. V. KOSTOCHKA, On upper bounds for the chromatic numbers of graphs, Trudy Instituta Mathematiki, 10(1988), pp. 204-226 (in Russian).
50. J. LEYDOLD AND P. STADLER, Minimal cycle bases of outerplanar graphs, Electron J. Combin., 5(1998), R16.
51. H. M. MULDER, The expansion procedure for graphs, in Contemporary Methods in Graph Theory, BI Wissenschaftsverlag, Mannheim, Germany, 1990, pp. 459-477.
52. H. M. MULDER, The Interval Function of a Graph, Math. Centre Tracts 132, Mathematisch Centrum, Amsterdam, 1980.
53. H. M. MULDER AND A. SCHRIJVER, Median graphs and Helly hypergraphs, Discrete Math., 25(1979), pp. 41-50.
54. B. NICA, Cubulating spaces with walls, Algebr. Geom. Topol., 4(2004), pp. 297-309.
55. A. NILL, Triangle-free graphs with large chromatic numbers, Discrete Math., 211(2000), pp. 261-262.
56. M. ROLLER, Poc Sets, Median Algebras and Group Actions, preprint, University of Southampton, Southampton, UK, 1998.
57. B. ROSGEN AND L. STEWART, Complexity results on graphs with few cliques, Discrete Math. Theor. Comput. Sci., 9(2007), pp. 127-136.
58. J. SAWADA, A fast algorithm for generating nonisomorphic chord diagrams, SIAM J. Discrete Math., 15(2002), pp. 546-561.
59. C. SEMPLE AND M. STEEL, Cyclic permutations and evolutionary trees, Adv. in Appl. Math., 32(2004), pp. 669-680.
60. P. SOLTAN, D. ZAMBITSKII, AND C. PRISǍCARU, Extremal Problems on Graphs and Algorithms of Their Solution, Ştiinţa, Chişinǎu, Moldova, 1973 (in Russian).
61. M. VAN DE VEL, Theory of Convex Structures, Elsevier, Amsterdam, 1993.