Eulerian graph embeddings and trails confined to lattice tubes
نویسندگان
چکیده
منابع مشابه
Enumerating Eulerian Trails Based on Line Graph Conversion
(Abstract) Given an undirected graph G, we consider enumerating all Eulerian trails, that is, walks containing each of the edges in G just once. We consider achieving it with the enumeration of Hamiltonian paths with the zero-suppressed decision diagram (ZDD), a data structure that can efficiently store a family of sets satisfying given conditions. First we compute the line graph L(G), the grap...
متن کاملTransforming eulerian trails
Fleischner, H., G. Sabidussi and E. Wenger, Transforming eulerian trails, Discrete Mathematics 109 (1992) 103-116. In this paper a set of transformations (K-transformations) between eulerian trails is investigated. It is known that two arbitrary eulerian trails can be transformed into each other by a sequence of K-transformations. For compatible eulerran trails the set of K-transformations is a...
متن کاملEmbeddings in Eulerian graceful graphs
Let G(V,E) be a graph of order n and size m. A graceful labeling of G is an injection f : V (G) → {0, 1, 2, ...,m} such that, when each edge uv is assigned the label f(uv) = |f(u)− f(v)|, the resultant edge labels are distinct. We focus on general results in graceful labeling, and provide an affirmative answer to the following open problem: Can every connected graph be embedded as an induced su...
متن کاملHyperclone Lattice and Embeddings
In this paper, hyperclone lattice is studied via three kinds of embeddings. One is from the clone lattice on A to the hyperclone lattice on A, the second is from the hyperclone lattice on A to the clone lattice on P (A) \ {∅} and the third one is from the hyperclone lattice on A′ to the hyperclone lattice on A, for A′ ⊂ A and the finite set A. The second map has usually been used for the descri...
متن کاملObstructions to directed embeddings of Eulerian digraphs in the plane
A 2-cell embedding of an Eulerian digraph in a closed surface is said to be directed if the boundary of each face is a directed closed walk in G. We prove Kuratowski-type theorems about obstructions to directed embeddings of Eulerian digraphs in the plane.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2006
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/42/1/023