Zeons, orthozeons, and graph colorings
From MaRDI portal
Publication:2361423
DOI10.1007/s00006-016-0742-2zbMath1365.05103OpenAlexW2550511128MaRDI QIDQ2361423
Publication date: 30 June 2017
Published in: Advances in Applied Clifford Algebras (Search for Journal in Brave)
Full work available at URL: https://spark.siue.edu/siue_fac/128
Related Items (8)
Norm inequalities in zeon algebras ⋮ Zeros of zeon polynomials and the zeon quadratic formula ⋮ Spectrally simple zeros of zeon polynomials ⋮ Hamiltonian cycle enumeration via fermion-zeon convolution ⋮ Zeon and idem-Clifford formulations of Boolean satisfiability ⋮ Zeon matrix inverses and the zeon combinatorial Laplacian ⋮ The Boolean satisfiability problem in Clifford algebra ⋮ Zeon and idem-Clifford formulations of hypergraph problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spinorial formulations of graph problems
- Polychromatic Hamilton cycles
- Partitions and Clifford algebras
- A new adjacency matrix for finite graphs
- Multicoloured Hamilton cycles
- Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs
- Sur le circuit hamiltonien bi-colore dans les graphes orientes
- Long heterochromatic paths in edge-colored graphs
- A spinorial formulation of the maximum clique problem of a graph
- Vertex coverings by monochromatic paths and cycles
- Reducibility among Combinatorial Problems
- Zeon Algebra and Combinatorial Identities
- The complexity of satisfiability problems
- Mathematical Foundations of Computer Science 2005
This page was built for publication: Zeons, orthozeons, and graph colorings