نتایج جستجو برای: hamilton jocobi bellmanhjb
تعداد نتایج: 13290 فیلتر نتایج به سال:
Journal:
:Discrete Mathematics
2009
Sibel Ozkan
Christopher A. Rodger
A k-factor of a graph is a k-regular spanning subgraph. A Hamilton cycle is a connected 2-factor. A graph G is said to be primitive if it contains no k-factor with 1 ≤ k < ∆(G). A Hamilton decomposition of a graph G is a partition of the edges of G into sets, each of which induces a Hamilton cycle. In this paper, by using the amalgamation technique, we find necessary and sufficient conditions f...
Journal:
:Archive for Rational Mechanics and Analysis
2010
Journal:
:C.Q.D.- Revista Eletrônica Paulista de Matemática
2020
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید