Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Daugherty, Caroline"'
We introduce $k$-maximal sub-polygon graphs ($k$-MSP graphs), the intersection graphs of maximal polygons contained in a polygon with sides parallel to a regular $2k$-gon. We prove that all complete graphs are $k$-MSP graphs for all $k>1$; trees are
Externí odkaz:
http://arxiv.org/abs/2104.13978
Autor:
Daugherty, Caroline1 (AUTHOR), Laison, Joshua D.2 (AUTHOR) jlaison@willamette.edu, Robinson, Rebecca3 (AUTHOR), Salois, Kyle4 (AUTHOR)
Publikováno v:
Graphs & Combinatorics. Aug2023, Vol. 39 Issue 4, p1-16. 16p.