Polynomial-time recognition and maximum independent set algorithms for Burling graphs using strict frame representations.
Triangle-free graphs with large chromatic number and no induced wheel.Journal of Graph Theory, 103(1):112–118, 2023
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Polynomial-time recognition and maximum independent set in Burling graphs
Polynomial-time recognition and maximum independent set algorithms for Burling graphs using strict frame representations.