Medians and centres of polyominoes

Information Processing Letters

Volumn 57, Issue 4, 1996, Pages 175-181

  Métivier, Yves ^a   Saheb, Nasser ^a  

^a CNRS   (France)

Author keywords

Centre; Combinatorial problems; Median; Polyomino

Indexed keywords

EID: 13544266638     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00005-1     Document Type: Article

References (11)

1. H.J. Bandelt and J.P. Barthélemy, Medians in median graphs, Discrete Appl. Math. 8 (1984) 131-142.
2. C. Berge, Graphes et Hypergraphes (Dunod, Paris, 1970).
3. M. Bousquet-Mélou, Polyominoes and polygons, Contemp. Math. 178 (1994) 55-70.
4. O. Gerstel and S. Zaks, A new characterization of tree medians with applications to distributed algorithms, DAIMI PB-364, Computer Science Dept., Århus University (1991).
5. K.S. Holbert, A note on graphs with distant center and median, in: V.R. Kulli, ed., Recent Studies in Graph Theory (Vishwa International Publications, 1989).
6. C. Jordan, Sur les assemblages de lignes, J. Reine Angew. Math. 70 (1869) 185-190.
7. A.N.C. Kang and D.A. Ault, Some properties of a centroid of a free tree, Inform. Process. Lett. 4 (1975) 18-20.
8. S. Mitchell, Another characterization of the centroid of a tree, Discrete Math. 24 (1978) 277-280.
9. P.J. Slater, Medians of arbitrary graphs, J. Graph Theory 4 (1980) 389-392.
10. X.G. Viennot, A survey of polyominoes enumeration, in: P. Leroux et C. Reutenauer, eds., Actes du 4ème colloque SFCA, "Séries formelles et combinatoire algébrique", Montréal, Publication du LACIM 11 (1992) 399-420.
11. B. Zelinka, Medians and peripherians of trees, Arch. Math. (Brno) (1968) 87-95.