Edge-domatically full graphs
Ein Axiomensystem für Baum-Algebren
Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen.
Elevation of a graph
e-locally acyclic graphs
End-faithful spanning trees of countable graphs with prescribed sets of rays
We prove that a countable connected graph has an end-faithful spanning tree that contains a prescribed set of rays whenever this set is countable, and we show that this solution is, in a certain sense, the best possible. This improves a result of Hahn and Širáň Theorem 1.
Equipped graphs and modular lattices attached to them
Equitable colorations of graphs
Equivalences between isomorphism classes on infinite graphs
The paper studies some equivalence relations between isomorphism classes of countable graphs which correspond in a certain sense to various distances between isomorphism classes of finite graphs.
Eulerian polar graphs
Every finite lattice can be embedded in the lattice of all equivalences over a finite set (Preliminary communication)
Every graph is an induced isopart of a circulant
Examples of Λ(4) sets E and a graph structure in E x E
Exklusive Graphen und Hamiltonsche Graphen n-ten Grades II.
Finite spherical geometries
Fixed-point-free embeddings of graphs in their complements.
Free hyperplane arrangements between A n -1 and Bn.
From Covering Designs to Graphs.
Fruit salad.
Frutex y caminos nodales.
Dado un grafo G = (X,E) con un solo vértice insaturado p, se estudia el problema de encontrar, para todo x ∈ X, un camino M-alternado par que una x con p. Se halla un algoritmo, y se plantea su aplicación cara a dar una variante del Algoritmo de Edmonds en la que no haya que contraer los pseudovértices.