Balanced Subdivision and Enumeration in Balanced Spheres.
Bartholdi zeta functions of fractal graphs.
Basic polyhedra in knot theory
Baxter permutations and plane bipolar orientations.
Bicubic planar maps
A numerical function of bicubic planar maps found by the author and colleagues is a special case of a polynomial due to François Jaeger.
Biembeddings of symmetric configurations and 3-homogeneous Latin trades
Using results of Altshuler and Negami, we present a classification of biembeddings of symmetric configurations of triples in the torus or Klein bottle. We also give an alternative proof of the structure of 3-homogeneous Latin trades.
Bi-Lipschitz embeddings of hyperspaces of compact sets
We study the bi-Lipschitz embedding problem for metric compacta hyperspaces. We observe that the compacta hyperspace K(X) of any separable, uniformly disconnected metric space X admits a bi-Lipschitz embedding in ℓ². If X is a countable compact metric space containing at most n nonisolated points, there is a Lipschitz embedding of K(X) in ; in the presence of an additional convergence condition, this embedding may be chosen to be bi-Lipschitz. By way of contrast, the hyperspace K([0,1]) of the...
Bipartite-uniform hypermaps on the sphere.
Bounded-degree graphs can have arbitrarily large slope numbers.
Bounded-degree graphs have arbitrarily large geometric thickness.
Bounds for orthogonal 3-D graph drawing.
Bridges and Hamiltonian circuits in planar graphs.
Calcul du centralisateur d'un groupe de permutations
Canonical decomposition of outerplanar maps and application to enumeration, coding and generation.
Centrally-symmetric tight surfaces and graph embeddings.
Certain cubic multigraphs and their upper embeddability
Characteristic polynomials of some weighted graph bundles and its application to links.
Characterization of semientire graphs with crossing number 2
The purpose of this paper is to give characterizations of graphs whose vertex-semientire graphs and edge-semientire graphs have crossing number 2. In addition, we establish necessary and sufficient conditions in terms of forbidden subgraphs for vertex-semientire graphs and edge-semientire graphs to have crossing number 2.
Characterizations of planar plick graphs
In this paper we present characterizations of graphs whose plick graphs are planar, outerplanar and minimally nonouterplanar.
Characterizing the maximum genus of a connected graph