Temat: spanning subgraph - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Even [a,b]-factors in graphs
Autorzy:: Kouider, Mekkia
Vestergaard, Preben
Powiązania:: https://bibliotekanauki.pl/articles/744553.pdf
Data publikacji:: 2004
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: even factor
eulerian
spanning subgraph
Opis:: Let a and b be integers 4 ≤ a ≤ b. We give simple, sufficient conditions for graphs to contain an even [a,b]-factor. The conditions are on the order and on the minimum degree, or on the edge-connectivity of the graph.
Źródło:: Discussiones Mathematicae Graph Theory; 2004, 24, 3; 431-441
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Decomposition of the Product of Cycles Based on Degree Partition
Autorzy:: Borse, Y. M.
Shaikh, S. R.
Powiązania:: https://bibliotekanauki.pl/articles/31343576.pdf
Data publikacji:: 2019-02-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: hypercube
Cartesian product
n-connected
regular
bipan- cyclic
spanning subgraph
Opis:: The Cartesian product of n cycles is a 2n-regular, 2n-connected and bi- pancyclic graph. Let G be the Cartesian product of n even cycles and let 2n = n₁+ n₂+ ・・・ + n_k with k ≥ 2 and n_i ≥ 2 for each i. We prove that if k = 2, then G can be decomposed into two spanning subgraphs G₁ and G₂ such that each G_i is n_i-regular, n_i-connected, and bipancyclic or nearly bipancyclic. For k > 2, we establish that if all n_i in the partition of 2n are even, then G can be decomposed into k spanning subgraphs G₁, G₂, . . ., G_k such that each G_i is n_i-regular and n_i-connected. These results are analogous to the corresponding results for hypercubes.
Źródło:: Discussiones Mathematicae Graph Theory; 2019, 39, 1; 241-256
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: On strongly spanning k-edge-colorable subgraphs
Autorzy:: Mkrtchyan, V. V.
Vardanyan, G. N.
Powiązania:: https://bibliotekanauki.pl/articles/255490.pdf
Data publikacji:: 2017
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:: k-edge-colorable subgraph
maximum k-edge-colorable subgraph
trongly spanning k-edge-colorable subgraph
[1, k]-factor.
Opis:: A subgraph H of a multigraph G is called strongly spanning, if any vertex of G is not isolated in H. H is called maximum k-edge-colorable, if H is proper k-edge-colorable and has the largest size. We introduce a graph-parameter sp(G), that coincides with the smallest k for which a multigraph G has a maximum k-edge-colorable subgraph that is strongly spanning. Our first result offers some alternative definitions of sp(G). Next, we show that Δ (G) is an upper bound for sp(G), and then we characterize the class of multigraphs G that satisfy sp(G) = Δ (G). Finally, we prove some bounds for sp(G) that involve well-known graph-theoretic parameters.
Źródło:: Opuscula Mathematica; 2017, 37, 3; 447-456
1232-9274
2300-6919
Pojawia się w:: Opuscula Mathematica
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja