From logical gates synthesis to chromatic bicritical clutters
From MaRDI portal
Publication:1961457
DOI10.1016/S0166-218X(99)00095-5zbMath0953.94044OpenAlexW2086134764MaRDI QIDQ1961457
Publication date: 14 February 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00095-5
Hypergraphs (05C65) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Boolean functions (06E30)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- \(K_ 5\) is the only double-critical 5-chromatic graph
- Critical hypergraphs for the weak chromatic number
- Post's closed systems and the weak chromatic number of hypergraphs
- Decompositions of positive self-dual Boolean functions
- The fundamental theorem of voting schemes
- Hajós' Theorem for Hypergraphs
- Hypergraphes Critiques Pour Le Nombre Chromatique Et Conjecture De Lovász
- On chromatic number of finite set-systems
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
This page was built for publication: From logical gates synthesis to chromatic bicritical clutters