Decomposition of an infinite complete graph into complete bipartite subgraphs Bohdan Zelinka (1984) Časopis pro pěstování matematiky
Decomposition of complete bipartite graphs into factors with given radii Eliška Tomová (1977) Mathematica Slovaca
Decomposition of complete bipartite graphs into factors with given diameters Eliška Tomová (1977) Mathematica Slovaca
Decomposition of complete graphs into trees Gary Haggard, Peter McWha (1975) Czechoslovak Mathematical Journal
Decompositions of complete k -uniform hypergraphs into factors with given diameters Pavel Tomasta (1976) Commentationes Mathematicae Universitatis Carolinae
Decompositions of graphs and hypergraphs into isomorphic factors with a given diameter Pavel Tomasta (1977) Czechoslovak Mathematical Journal
Definability in structures of finite valency I. Korec, M. Peretiatkin, W. Rautenberg (1974) Fundamenta Mathematicae
Degree sets for homogeneously traceable non-Hamiltonian graphs Ronald J. Gould (1981) Colloquium Mathematicae
Delaunay Graphs Are Almost as Good as Complete Graphs. D.P. Dobkin, S.J. Friedman, K.J. Supowit (1990) Discrete & computational geometry
Dénombrements relatifs à une définition combinatoire de la continuité sur un graphe G. Kreweras (1975) Mathématiques et Sciences Humaines
Dépliage d'un graphe pointé en un cactus S. R. Schwer (1987) RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Different types of products and subdirectly irreducible E. Suková, Jiří Vinárek (1986) Acta Universitatis Carolinae. Mathematica et Physica
Dimension of the sum of several copies of a graph Pavel Křivka (1985) Czechoslovak Mathematical Journal