Bipartite knots
We give a solution to a part of Problem 1.60 in Kirby's list of open problems in topology, thus answering in the positive the question raised in 1987 by J. Przytycki.
Bipartite toughness and -factors in bipartite graphs.
Bipartite-uniform hypermaps on the sphere.
Bipartition orders and statistics on words. (Ordres bipartitionnaires et statistiques sur les mots.)
Bipartition Polynomials, the Ising Model, and Domination in Graphs
This paper introduces a trivariate graph polynomial that is a common generalization of the domination polynomial, the Ising polynomial, the matching polynomial, and the cut polynomial of a graph. This new graph polynomial, called the bipartition polynomial, permits a variety of interesting representations, for instance as a sum ranging over all spanning forests. As a consequence, the bipartition polynomial is a powerful tool for proving properties of other graph polynomials and graph invariants....
Biplanes.
Biregular edge-symmetric graphs
Bitableaux bases for some Garsia-Haiman modules and other related modules.
Block decomposition approach to compute a minimum geodetic set
In this paper, we develop a divide-and-conquer approach, called block decomposition, to solve the minimum geodetic set problem. This provides us with a unified approach for all graphs admitting blocks for which the problem of finding a minimum geodetic set containing a given set of vertices (g-extension problem) can be efficiently solved. Our method allows us to derive linear time algorithms for the minimum geodetic set problem in (a proper superclass of) block-cacti and monopolar chordal graphs....
Block distance matrices.
Block Intersections in Quasi-Residual Designs.
Block Intersections in Quasi-Residual Designs. (Short Communication).
Block triangular preconditioners for -matrices and Markov chains.
Block-closed subgraphs and q-partitions of graphs
Blocking sets of 16 points in projective planes of order 10 - III
Blocking sets of maximal type in finite projective planes
Blocks for symmetric groups and their covering groups and quadratic forms.
Bonferroni-Galambos inequalities for partition lattices.
Boolean differential operators
We consider four combinatorial interpretations for the algebra of Boolean differential operators and construct, for each interpretation, a matrix representation for the algebra of Boolean differential operators.
Boolean graphs