Loading [MathJax]/extensions/MathZoom.js
Displaying 741 –
760 of
5365
New compact representations of infinite graphs are
investigated. Finite automata are used to represent labelled hyper-graphs
which can be also multi-graphs. Our approach consists of a general
framework where vertices are represented by a regular prefix-free language and
edges are represented by a regular language and a function over tuples.
We consider three different functions over tuples:
given a tuple
the first function returns its
first difference, the second one returns its suffix and...
2000 Mathematics Subject Classification: 17A50, 05C05.In this note we present the formula for the coefficients of the substitution series f(g(x)) of planar tree power series g(x) into f(x).
While defining the anti-Ramsey number Erdős, Simonovits and Sós mentioned that the extremal colorings may not be unique. In the paper we discuss the uniqueness of the colorings, generalize the idea of their construction and show how to use it to construct the colorings of the edges of complete split graphs avoiding rainbow 2-connected subgraphs. These colorings give the lower bounds for adequate anti-Ramsey numbers.
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...
Currently displaying 741 –
760 of
5365