Das Problem der Dreiercliquen.- Ein Beitrag zur Graphentheorie.
Decompositions into two paths
It is proved that a connected multigraph G which is the union of two edge-disjoint paths has another decomposition into two paths with the same set, U, of endvertices provided that the multigraph is neither a path nor cycle. Moreover, then the number of such decompositions is proved to be even unless the number is three, which occurs exactly if G is a tree homeomorphic with graph of either symbol + or ⊥. A multigraph on n vertices with exactly two traceable pairs is constructed for each n ≥ 3. The...
Decompositions of Complete Graphs into Factors with Diameter Two
Decompositions of complete -uniform hypergraphs into factors with given diameters
Decompositions of graphs into 5-cycles and other small graphs.
Decompositions of quadrangle-free planar graphs
W. He et al. showed that a planar graph not containing 4-cycles can be decomposed into a forest and a graph with maximum degree at most 7. This degree restriction was improved to 6 by Borodin et al. We further lower this bound to 5 and show that it cannot be improved to 3.
Degree powers in graphs with a forbidden even cycle.
Degree powers in graphs with forbidden subgraphs.
Degree sequences of -free graphs.
Dénombrements des cycles hamiltoniens de et empruntant ou évitant des arêtes données
Dense -free graphs are almost -partite.
Densities of minor-closed graph families.
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
Die Klasse der minimalen, nicht-projektiven Graphen mit einer Kreuzhaube.
Digraphs maximal with respect to connectivity
Dimension of the sum of two copies of a graph
Directed graphs and matrix equations
Disjoint Edges in Geometric Graphs.
Distance in graphs