Boolean Algebra, Map Coloring, and Interconnections

DOI10.2307/2310823zbMath0221.05063OpenAlexW4255145958MaRDI QIDQ5625210

John Weissman

Publication date: 1962

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2310823

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Boolean algebras (Boolean rings) (06E99)

Related Items (6)

Complexity and performance of a graph theory algorithm for cluster analysis† ⋮ On finding optimal covers ⋮ Segmental solutions of Boolean equations ⋮ Axiomatization of certain problems of minimization ⋮ A note on the derivation of maximal compatibility classes ⋮ 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