Hypercubes defined on \(n\)-ary sets, the Erdös-Faber-Lovász conjecture on graph coloring, and the description spaces of polypeptides and RNA
Publication:2278810
DOI10.1007/s10910-019-01065-6zbMath1429.92112OpenAlexW2973326097WikidataQ123159372 ScholiaQ123159372MaRDI QIDQ2278810
Ramon Carbó-Dorca, Tanmoy Chakraborty
Publication date: 11 December 2019
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10910-019-01065-6
graph coloring\(n\)-ary \(N\)-dimensional hypercubes\(N\)-dimensional hypercube generationErdös-Faber-Lovász conjectureprotein generator spacesRNA generator spacesunnatural proteinsunnatural RNA
Related Items (3)
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- \(N\)-dimensional Boolean hypercubes and the Goldbach conjecture
- A study on Goldbach conjecture
- Multimolecular polyhedra and QSPR
- On the combinatorial problems which I would most like to see solved
- Fuzzy sets and Boolean tagged sets
- About some questions relative to the arbitrariness of signs: their possible consequences in matrix signatures definition and quantum chemical applications
- Combinatorial multinomial generators for colorings of 4D-hypercubes and their applications
- Quantum polyhedra, definitions, statistics and the construction of a collective quantum similarity index
- Role of the structure of Boolean hypercubes when used as vectors in natural (Boolean) vector semispaces
- DNA, unnatural base pairs and hypercubes
This page was built for publication: Hypercubes defined on \(n\)-ary sets, the Erdös-Faber-Lovász conjecture on graph coloring, and the description spaces of polypeptides and RNA