-favouring Eulerian trails in digraphs
-equienergetic self-complementary graphs
D sets and IP rich sets in ℤ
We give combinatorial characterizations of IP rich sets (IP sets that remain IP upon removal of any set of zero upper Banach density) and D sets (members of idempotent ultrafilters, all of whose members have positive upper Banach density) in ℤ. We then show that the family of IP rich sets strictly contains the family of D sets.
Dartboard arrangements.
Das lexikographische Produkt gerichteter Graphen.
Das Problem der Dreiercliquen.- Ein Beitrag zur Graphentheorie.
D-Dimensional Hypercubes and the Euler and MacNeish Conjectures.
De Bruijn cycles and their application for encoding of discrete positions
De la partition des nombres
De partitione numerorum.
Decidability problems for the variety generated by tournaments.
Deciding clique-width for graphs of bounded tree-width.
Deciding soccer scores and partial orientations of graphs.
Decomposability of Abstract and Path-Induced Convexities in Hypergraphs
An abstract convexity space on a connected hypergraph H with vertex set V (H) is a family C of subsets of V (H) (to be called the convex sets of H) such that: (i) C contains the empty set and V (H), (ii) C is closed under intersection, and (iii) every set in C is connected in H. A convex set X of H is a minimal vertex convex separator of H if there exist two vertices of H that are separated by X and are not separated by any convex set that is a proper subset of X. A nonempty subset X of V (H) is...
Decomposing a planar graph into a forest and a subgraph of restricted maximum degree.
Decomposing complete equipartite graphs into short odd cycles.
Decomposing complete graphs into cubes
This paper concerns when the complete graph on n vertices can be decomposed into d-dimensional cubes, where d is odd and n is even. (All other cases have been settled.) Necessary conditions are that n be congruent to 1 modulo d and 0 modulo . These are known to be sufficient for d equal to 3 or 5. For larger values of d, the necessary conditions are asymptotically sufficient by Wilson’s results. We prove that for each odd d there is an infinite arithmetic progression of even integers n for which...
Decomposing complete tripartite graphs into closed trails of arbitrary lengths
The complete tripartite graph has edges. For any collection of positive integers with and for , we exhibit an edge-disjoint decomposition of into closed trails (circuits) of lengths .
Decomposing infinite 2-connected graphs into 3-connected components.
Decomposition of a complete equipartite graph into isomorphic subgraphs