An algebraic characterization of 𝑘–colorability

DOI10.1090/proc/15391OpenAlexW3102300031MaRDI QIDQ5856981

Thomas Koberda, Delaram Kahrobaei, Ramón J. Flores

Publication date: 30 March 2021

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.01484

Mathematics Subject Classification ID

Applications of graph theory (05C90) Relations of low-dimensional topology with graph theory (57M15)

Related Items (2)

Geometry and Combinatorics via Right-Angled Artin Groups ⋮ Hamiltonicity via cohomology of right-angled Artin groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On rigidity and the isomorphism problem for tree braid groups.
• Algorithmic problems in right-angled Artin groups: complexity and applications
• Automorphisms of graph groups.
• Right-angled Artin groups and a generalized isomorphism problem for finitely generated subgroups of mapping class groups
• Embeddability between right-angled Artin groups..
• An introduction to right-angled Artin groups.
• Poly-free constructions for right-angled Artin groups
• Gröbner Bases, Coding, and Cryptography
• On commuting elements and embeddings of graph groups and monoids
• Isomorphisms of Graph Groups
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Connectivity at infinity for right angled Artin groups
• Free products and the algebraic structure of diffeomorphism groups
• Computational Complexity

This page was built for publication: An algebraic characterization of 𝑘–colorability