Diagonalizable embedding of composition graphs
Diagonalization and rationalization of algebraic Laurent series
We prove a quantitative version of a result of Furstenberg [20] and Deligne [14] stating that the diagonal of a multivariate algebraic power series with coefficients in a field of positive characteristic is algebraic. As a consequence, we obtain that for every prime the reduction modulo of the diagonal of a multivariate algebraic power series with integer coefficients is an algebraic power series of degree at most and height at most , where is an effective constant that only depends on...
Diagonals on the permutahedra, multiplihedra and associahedra.
Diameter in path graphs.
Diameter in walk graphs.
Diameter-invariant graphs
The diameter of a graph is the maximal distance between two vertices of . A graph is said to be diameter-edge-invariant, if for all its edges, diameter-vertex-invariant, if for all its vertices and diameter-adding-invariant if for all edges of the complement of the edge set of . This paper describes some properties of such graphs and gives several existence results and bounds for parameters of diameter-invariant graphs.
Diametrically critical tournaments
Diamond representations of
In [6], there is a graphic description of any irreducible, finite dimensional module. This construction, called diamond representation is very simple and can be easily extended to the space of irreducible finite dimensional -modules.In the present work, we generalize this construction to . We show it is in fact a description of the reduced shape algebra, a quotient of the shape algebra of . The basis used in [6] is thus naturally parametrized with the so called quasi standard Young tableaux....
Dichromatic number, circulant tournaments and Zykov sums of digraphs
The dichromatic number dc(D) of a digraph D is the smallest number of colours needed to colour the vertices of D so that no monochromatic directed cycle is created. In this paper the problem of computing the dichromatic number of a Zykov-sum of digraphs over a digraph D is reduced to that of computing a multicovering number of an hypergraph H₁(D) associated to D in a natural way. This result allows us to construct an infinite family of pairwise non isomorphic vertex-critical k-dichromatic circulant...
Dichteste Packungen von gleichen Kreisen in einem Quadrat.
Die Anzahl der primitiven Polytope im ... mit 2 d - 2 Facetten.
Die chromatischen polynome Unterringfreier Graphen.
Die Klasse der minimalen, nicht-projektiven Graphen mit einer Kreuzhaube.
Die Kombinationen gegebenen Profils. I
Die Kombinationen gegebenen Profils. II
Die Kombinationen gegebenen Profils. III
Die Minimalbasis der Menge aller nicht in die projektive Ebene einbettbaren Graphen.
Die Struktur der automorphismen spezieller, endlicher, ebener, dreifach-knotenzusammenhängender graphen
Die Varietät der auflösbaren Ternare der Ordnung 2
Die Zerlegung spezieller Einheitskreisüberdeckungen in drei Einheitskreispackungen