Decompositions of pseudographs into closed trails of even sizes
نویسندگان
چکیده
We consider a graph Ln, with n even, which is a complete graph with an additional loop at each vertex and minus 1-factor and we prove that it is edge-disjointly decomposable into closed trails of even lengths greater than four, whenever these lengths sum up to the size of the graph Ln. We also show that this statement remains true if we remove from Ln two loops attached to nonadjacent vertices. Consequently, we improve P. Wittmann’s result on the upper bound of the irregular coloring number c(G) of a 2-regular graph G of size n, by determining that this number is, with the inadequacy of one, equal to d√2ne if all components of G have even orders.
منابع مشابه
2-perfect Closed M-trail Systems of the Complete Directed Graph with Loops
Certain decompositions of complete directed graphs with loops into collections of closed trails which partition the edge set of the graph give rise to, and arise from, quasigroups. Such decompositions are said to be 2-perfect. The existence of these 2-perfect decompositions in which the closed trails are all of the same length m is examined. In particular, the set of values of n for which the o...
متن کاملArbitrary decompositions into open and closed trails
The problem of arbitrary decomposition of a graph G into closed trails i.e. a decomposition into closed trails of prescribed lengths summing up to the size of the graph G was first considered in the case of the complete graph G = Kn (for odd n) in connection with vertexdistinguishing coloring of the union of cycles. Next, the same problem was investigated for other families of graphs. In this p...
متن کاملThe complete multigraphs and their decompositions into open trails
Balister [Combin. Probab. Comput. 12 (2003), 1–15] gave a necessary and sufficient condition for a complete multigraph Kn to be arbitrarily decomposable into closed trails of prescribed lengths. In this article we solve the corresponding problem showing that the multigraphs Kn are arbitrarily decomposable into open trails.
متن کاملSome Generalizations of Locally Closed Sets
Arenas et al. [1] introduced the notion of lambda-closed sets as a generalization of locally closed sets. In this paper, we introduce the notions of lambda-locally closed sets, Lambda_lambda-closed sets and lambda_g-closed sets and obtain some decompositions of closed sets and continuity in topological spaces.
متن کاملCombinatorics on Adjacency Graphs and Incidence Pseudographs
The paper starts with a brief review of combinatorial results for adjacency and oriented adjacency graphs (combinatorial maps). The main subject is incidence pseudographs (a dual of cell complexes) of the n-dimensional orthogonal grid. It is well known that these pseudographs (or complexes) allow a definition of a topological space, and combinatorial formulas are provided for characterizing ope...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2009