$K_{1,3}$-covering red and blue points in the plane
We say that a finite set of red and blue points in the plane in general position can be $K_{1,3}$-covered if the set can be partitioned into subsets of size $4$, with $3$ points of one color and $1$ point of the other color, in such a way that, if at each subset the fourth point is connected by stra...
| Published in: | Discrete Mathematics & Theoretical Computer Science |
|---|---|
| Main Authors: | , , , , , , |
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2019-01-01
|
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/4537/pdf |