Degree-constrained edge partitioning in graphs arising from discrete tomography.
Degree-continuous graphs
A graph is degree-continuous if the degrees of every two adjacent vertices of differ by at most 1. A finite nonempty set of integers is convex if for every integer with . It is shown that for all integers and and a convex set with and , there exists a connected degree-continuous graph with the degree set and diameter . The minimum order of a degree-continuous graph with a prescribed degree set is studied. Furthermore, it is shown that for every graph and convex set of...
Degrees, neighbourhoods and closure operations.
Delannoy and tetrahedral numbers
We establish an identity between Delannoy numbers and tetrahedral numbers of arbitrary dimension.
Delaunay Graphs Are Almost as Good as Complete Graphs.
Dělové koule a včelí plásty
Delta link-homotopy on spatial graphs.
We study new equivalence relations in spatial graph theory. We consider natural generalizations of delta link-homotopy on links, which is an equivalence relation generated by delta moves on the same component and ambient isotopies. They are stronger than edge-homotopy and vertex-homotopy on spatial graphs which are natural generalizations of link-homotopy on links. Relationship to existing familiar equivalence relations on spatial graphs are stated, and several invariants are defined by using the...
Dénombrements de chemins dans soumis à contraintes
Dénombrements des cycles hamiltoniens de et empruntant ou évitant des arêtes données
Dénombrements relatifs à une définition combinatoire de la continuité sur un graphe
Dense Arbitrarily Partitionable Graphs
A graph G of order n is called arbitrarily partitionable (AP for short) if, for every sequence (n1, . . . , nk) of positive integers with n1 + ⋯ + nk = n, there exists a partition (V1, . . . , Vk) of the vertex set V (G) such that Vi induces a connected subgraph of order ni for i = 1, . . . , k. In this paper we show that every connected graph G of order n ≥ 22 and with [...] ‖G‖ > (n−42)+12 edges is AP or belongs to few classes of exceptional graphs.
Dense -free graphs are almost -partite.
Dense packings of equal disks in an equilateral triangle: From 22 to 34 and beyond.
Dense packings of equal spheres in a cube.
Densité et dimension
Une partie de est appelée une classe de Vapnik-Cervonenkis si la croissance de la fonction est polynomiale; ces classes se trouvent être utiles en Statistique et en Calcul des Probabilités (voir par exemple Vapnik, Cervonenkis [V.N. Vapnik, A.YA. Cervonenkis, Theor. Prob. Appl., 16 (1971), 264-280], Dudley [R.M. Dudley, Ann. of Prob., 6 (1978), 899-929]).Le présent travail est un essai de synthèse sur les classes de Vapnik-Cervonenkis. Mais il contient aussi beaucoup de résultats nouveaux,...
Densities of minor-closed graph families.
Dépliage d'un graphe pointé en un cactus
Der Darstellungssatz der Allgemeinen Differenzenmethode.
Derangement polynomials and excedances of type .
Derangements and asymptotics of the Laplace transforms of large powers of a polynomial.