کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9516102 | 1343761 | 2005 | 56 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Decompositions of infinite graphs: Part II circuit decompositions
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
We characterize the graphs that admit a decomposition into circuits, i.e. finite or infinite connected 2-regular graphs. Moreover, we show that, as is the case for the removal of a closed eulerian subgraph from a finite graph, removal of a non-dominated eulerian subgraph from a (finite or infinite) graph does not change its circuit-decomposability or circuit-indecomposability. For cycle-decomposable graphs, we show that in any end which contains at least n+1 pairwise edge-disjoint rays, there are n edge-disjoint rays that can be removed from the graph without altering its cycle-decomposability. We also generalize the notion of the parity of the degree of a vertex to vertices of infinite degree, and in this way extend the well-known result that eulerian finite graphs are circuit-decomposable to graphs of arbitrary cardinality.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Combinatorial Theory, Series B - Volume 94, Issue 2, July 2005, Pages 278-333
Journal: Journal of Combinatorial Theory, Series B - Volume 94, Issue 2, July 2005, Pages 278-333
نویسندگان
François Laviolette,