4-Cycle PackingGraph PackingIn this paper we consider the problem of finding the smallest number such that any graph G of order n admits a decomposition into edge disjoint copies of Cand single edges with at most elements. We solve this problem for sufficiently large....
An L-cycle cover is a cycle cover in which the length of e... B Manthey - International Conference on Graph-theoretic Concepts in Computer Science 被引量: 14发表: 2006年 Even cycle decompositions of 4-regular graphs and line graph An even cycle decomposition of a graph is a partition of...
For all integers n greater than or equal to 5, it is shown that the graph obtained from the n-cycle by joining vertices at distance 2 has a 2-factorization... D Bryant - 《Journal of Combinatorial Designs》 被引量: 80发表: 2004年 An asymptotic solution to the cycle decomposition problem...
For all m (identically equal to) 0 (mod 4), for all n (identically equal to) 0 or 2 (mod m ), and for all n (identically equal to) 1 (mod 2 m ) we find an m -cycle decomposition of the line graph of the complete graph Kn . In particular, this solves the existence ...
pythonbenchmarkmachine-learningtime-seriesjupyterscikit-learncyclepandasforecastinghorizontransformationtrendexogenousseasonalautoregressiveautomlarxautomatic-forecastinghierarchical-forecastingsignal-decomposition UpdatedJan 19, 2025 Python Sustainable transport planning with R ...
This article establishes a relationship between the real (circular) flow number of a graph and its cycle rank. We show that a connected graph with real flow number p / q +1, where p and q are two relatively prime numbers must have cycle rank at least p + q - 1. A special case of...
This result is proved as a consequence of a more general result that gives necessary and sufficient conditions for the existence of an m -cycle decomposition of a complete graph of order v with a hole of size u in the case where and both hold. 展开 ...
The central object that connects cycle games with infinite-duration games is the cycles-decomposition of a path (used for example by [12] to derive the value of a mean-payoff game). Informally, a path is decomposed by pushing the edges of the path onto a stack and, as soon as a cycle...
cycleeven-cycle decompositionEuleriancographTony HuynhDÉPARTEMENT DE MATHÉMATIQUE, UNIVERSITÉ LIBRE DE BRUXELLES BOULEVARD DU TRIOMPHE BRUSSELS BELGIUMAndrew D. KingDEPARTMENT OF MATHEMATICS, SIMON FRASER UNIVERSITY UNIVERSITY DRIVE BURNABY BC CANADASang-il Oum...
J. Graph Theory, 13 (1989), pp. 417-426 CrossrefView in ScopusGoogle Scholar 8 C.C. Linder, C.A. Rodger Decomposition into cycles. II. Cycle systems J.H. Dinitz, D.R. Stinson (Eds.), Contemporary Design Theory: A Collection of Surveys, Wiley, New York (1992), pp. 325-369 Goo...