Colouring simplicial complexes via the Lechuga-Murillo's model

DOI10.1007/s00200-020-00440-0zbMath1486.05333arXiv1610.07174OpenAlexW3034485996MaRDI QIDQ2121573

Yanyan Li

Publication date: 4 April 2022

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

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

zbMATH Keywords

rational homotopy theorySullivan algebra

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Combinatorial aspects of simplicial complexes (05E45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chromatic polynomials of simplicial complexes
• Every finite group is the group of self-homotopy equivalences of an elliptic space
• Realisability problem in arrow categories
• Determining the total colouring number is NP-hard
• The total graph of a hypergraph
• On the realizability of group actions
• Complexity in rational homotopy
• Hypergraph theory. An introduction
• Rational homotopy theory for computing colorability of simplicial complexes
• The NP-Completeness of Edge-Coloring
• Homotopically rigid Sullivan algebras and their applications
• NP completeness of finding the chromatic index of regular graphs
• The fundamental class of a rational space, the graph coloring problem and other classical decision problems

This page was built for publication: Colouring simplicial complexes via the Lechuga-Murillo's model