Boltzmann Samplers, Pólya Theory, and Cycle Pointing
Bottom-Left Placement Theorem for Rectangle Packing
Boundary cliques, clique trees and perfect sequences of maximal cliques of a chordal graph
Bounded Search Tree Algorithms for Parameterized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes
Bounding the Feedback Vertex Number of Digraphs in Terms of Vertex Degrees
Bounds for identifying codes in terms of degree parameters
Bounds on the maximum multiplicity of some common geometric graphs
Bounds on the Number of Longest Common Subsequences
Bricks and conjectures of Berge, Fulkerson and Seymour