scientific article
From MaRDI portal
Publication:3741636
zbMath0604.05018MaRDI QIDQ3741636
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Coloring of graphs and hypergraphs (05C15) Boolean functions (06E30) Applications of graph theory to circuits and networks (94C15) Positional games (pursuit and evasion, etc.) (91A24) Logical aspects of Boolean algebras (03G05)
Related Items
Trees as semilattices, Factoring Boolean functions using graph partitioning, Reconstructing unrooted phylogenetic trees from symbolic ternary metrics, Friendship two-graphs, On CIS circulants, Attempting perfect hypergraphs, Injective split systems, Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs, Minimum self-dual decompositions of positive dual-minor Boolean functions, Computing square roots of trivially perfect and threshold graphs, Not complementary connected and not CIS \(d\)-graphs form weakly monotone families, Decomposing complete edge-chromatic graphs and hypergraphs. Revisited, Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games, Dominating sequences in graphs, Characterizations of cographs as intersection graphs of paths on a grid, Three-way symbolic tree-maps and ultrametrics, Tight and effectively rectangular game forms: A Nash solvable class, Vertex- and edge-minimal and locally minimal graphs
