✦ LIBER ✦

Decomposable Near Polygons

✍ Scribed by Bart De Bruyn

Publisher: Springer
Year: 2004
Tongue: English
Weight: 277 KB
Volume: 8
Category: Article
ISSN: 0218-0006
DOI: 10.1007/s00026-004-0219-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Convex Polygons are Cover-Decomposable

✍ Dömötör Pálvölgyi; Géza Tóth 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 427 KB

Glued Near Polygons

✍ Bart De Bruyn 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 321 KB

We generalize a construction given in [3] to derive new near polygons from spreads of symmetry in generalized quadrangles.

Near-unanimity is decomposable

✍ Luís Sequeira 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 148 KB

An efficient algorithm for decomposing a

An efficient algorithm for decomposing a polygon into star-shaped polygons

✍ D. Avis; G.T. Toussaint 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 291 KB

Near polygons and Fischer spaces

✍ A. E. Brouwer; A. M. Cohen; H. A. Wilbrink; J. J. Hall 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 1010 KB

Homogeneous Graphs and Regular Near Poly

Homogeneous Graphs and Regular Near Polygons

✍ K. Nomura 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 210 KB

We consider a distance-regular graph having homogeneous edge patterns in each entry of its intersection diagram with respect to an edge. We call such graphs homogeneous graphs. We study elementary properties of homogeneous graphs, and we show these graphs are related deeply with regular near polygon