-valuations of graphs
Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number
We continue the study on backbone colorings, a variation on classical vertex colorings that was introduced at WG2003. Given a graph G = (V,E) and a spanning subgraph H of G (the backbone of G), a λ-backbone coloring for G and H is a proper vertex coloring V→ {1,2,...} of G in which the colors assigned to adjacent vertices in H differ by at least λ. The algorithmic and combinatorial properties of backbone colorings have been studied for various types of backbones in a number of papers. The main outcome...
Baire classification and infinite perceptrons
Balanced aspect ratio trees and their use for drawing large graphs.
Balanced Gray codes.
Balanced integral trees
Balanced online Ramsey games in random graphs.
Balanced path decomposition of and
Let denote a path with edges and denote the -fold complete bipartite graph with both parts of size . In this paper, we obtain the necessary and sufficient conditions for to have a balanced -decomposition. We also obtain the directed version of this result.
Balanced problems on graphs with categorization of edges
Suppose a graph G = (V,E) with edge weights w(e) and edges partitioned into disjoint categories S₁,...,Sₚ is given. We consider optimization problems on G defined by a family of feasible sets (G) and the following objective function: For an arbitrary number of categories we show that the L₅-perfect matching, L₅-a-b path, L₅-spanning tree problems and L₅-Hamilton cycle (on a Halin graph) problem are NP-complete. We also summarize polynomiality results concerning above objective functions for arbitrary...
Balanced Subdivision and Enumeration in Balanced Spheres.
Balanced ternary designs with block size three, any ... and any R.
Balancing cyclic -ary Gray codes.
Balancing cyclic -ary Gray codes. II.
Balls on the lawn.
Band combinatorics of domestic string algebras
We prove that the multiplicity of a simple module as a composition factor in a composition series for a primitive band module over a domestic string algebra is at most two.
Baron Münchhausen redeems himself: bounds for a coin-weighing puzzle.
Bartholdi zeta functions for hypergraphs.
Bartholdi zeta functions of fractal graphs.
Barycentric Ramsey numbers for small graphs.
Barycentric-sum problems: a survey.