Intersection Graphs of Maximal Sub-polygons of k-Lizards
Abstract 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...
Main Authors: | Daugherty, Caroline, Laison, Joshua D., Robinson, Rebecca, Salois, Kyle |
---|---|
Other Authors: | Massachusetts Institute of Technology. Operations Research Center |
Format: | Article |
Language: | English |
Published: |
Springer Japan
2023
|
Online Access: | https://hdl.handle.net/1721.1/150974 |
Similar Items
-
On k-convex polygons
by: Aichholzer, Oswin, et al.
Published: (2014) -
On extremal k-graphs without repeated copies of 2-intersecting edges
by: Ling, Alan C. H., et al.
Published: (2009) -
Circumscribing Polygons and Polygonizations for Disjoint Line Segments
by: Akitaya, Hugo A., et al.
Published: (2022) -
Closed quasigeodesics, escaping from polygons, and conflict-free graph coloring
by: Hesterberg, Adam Classen
Published: (2018) -
Influence maximization on dynamic graphs
by: Lim, Zi Xiang
Published: (2017)