We characterize planar graphs and graph minors among other graph theoretic notions in terms of right-angled Artin groups (RAAGs). For this, we determine all sets of elements in RAAGs with ears as underlying graphs that are exactly the sets of vertex generators. Generalizing ear decompositions of graphs to loose ear decompositions, we characterize both decompositions in terms of RAAGs. The desired results follow as applications of loose ear decompositions of RAAGs.
No takes yet. Share an insight, caveat, or question.
Max Gheorghiu (2024) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: