Burling graphs revisited, part I: New characterizations.European Journal of Combinatorics , 110:Article 103686, 2023

Pegah Pournajafi, Nicolas Trotignon · 2023

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

math.CO · 2024-07-23 · unverdicted · novelty 8.0

Polynomial-time recognition and maximum independent set algorithms for Burling graphs using strict frame representations.

Showing 1 of 1 citing paper.

Polynomial-time recognition and maximum independent set in Burling graphs math.CO · 2024-07-23 · unverdicted · none · ref 12
Polynomial-time recognition and maximum independent set algorithms for Burling graphs using strict frame representations.