Boolean Algebra, Map Coloring, and Interconnections
From MaRDI portal
Cited in
(6)- Segmental solutions of Boolean equations
- Axiomatization of certain problems of minimization
- A note on the derivation of maximal compatibility classes
- Complexity and performance of a graph theory algorithm for cluster analysis†
- On finding optimal covers
- Strong connectivity in symmetric graphs and generation of maximal minimally strongly connected subgraphs
This page was built for publication: Boolean Algebra, Map Coloring, and Interconnections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5625210)