Results 221 to 230 of about 517,969 (263)
Salvianic Acid A Regulates Ferroptosis by Activating the Nrf2-GPX4 Pathway Through EGFR to Protect Myocardial Ischemia-Reperfusion Injury. [PDF]
J Inflamm ResTu L, Lu Y, Liu X, Shen X.
europepmc +1 more source
The Regulatory Mechanism and Value in Early Diagnosis and Prognosis Assessment of miR-4448 in Breast Cancer. [PDF]
Breast Cancer (Dove Med Press)Zhang Z +6 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Factors and factorizations of graphs—a survey
Journal of Graph Theory, 1985AbstractA degree factor of a graph is either an r‐factor (regular of degree r) or an [m, n]‐factor (with each degree between m and n). In a component factor, each component is a prescribed graph. Both kinds of factors are surveyed, and also corresponding factorizations.
Jin Akiyama, Mikio Kano
openaire +1 more source
Hamiltonian ?-factors in graphs
Journal of Graph Theory, 1997A hamiltonian \(k\)-factor of a graph \(X\) is a spanning subgraph which is \(k\)-regular and contains a Hamilton cycle. The authors prove that a graph \(X\) of order \(n\) has a hamiltonian \(k\)-factor when \(k\geq 2\), \(n \geq 8k-4\), \(kn\) is even and the minimum degree of \(X\) is at least \(n/2\).
Bing Wei 0001, Yongjin Zhu
openaire +2 more sources
Combinatorica, 1981
This exposition is concerned with the main theorems of graph-factor theory, Hall’s and Ore’s Theorems in the bipartite case, and in the general case Petersen’s Theorem, the 1-Factor Theorem and thef-Factor Theorem. Some published extensions of these theorems are discussed and are shown to be consequences rather than generalizations of thef-Factor ...
openaire +1 more source
This exposition is concerned with the main theorems of graph-factor theory, Hall’s and Ore’s Theorems in the bipartite case, and in the general case Petersen’s Theorem, the 1-Factor Theorem and thef-Factor Theorem. Some published extensions of these theorems are discussed and are shown to be consequences rather than generalizations of thef-Factor ...
openaire +1 more source
Chromatic factorizations of a graph
Journal of Graph Theory, 1988AbstractLet n1 ⩾ n2 ⩾ …︁ ⩾ nk ⩾ 2 be integers. We say that G has an (n1, n2, …︁, nk‐chromatic factorization if G) can be edge‐factored as G1 ⊕ G2 ⊕ …︁ ⊕ Gk with χ(Gi) = nAi, for i = 1,2,…, k. The following results are proved: If (n1 − 1)n2 …︁ nk < χ(G) ⩽ n1n2 …︁ nk, then G has an (n1, n2, …︁, nk)‐chromatic factorization.
S. Louis Hakimi, Edward F. Schmeichel
openaire +2 more sources
Canadian Journal of Mathematics, 1977
Let G be a graph with multiple edges. Let f be a function from the vertex set V(G) of G to the non-negative integers. An f-factor of G is a spanning subgraph F of G such that the degree (valence) of each vertex x in F is f(x). A theorem of Fulkerson, Hoffman and McAndrew [1] gives necessary and sufficient conditions to have an f-factor for a graph G ...
openaire +1 more source
Let G be a graph with multiple edges. Let f be a function from the vertex set V(G) of G to the non-negative integers. An f-factor of G is a spanning subgraph F of G such that the degree (valence) of each vertex x in F is f(x). A theorem of Fulkerson, Hoffman and McAndrew [1] gives necessary and sufficient conditions to have an f-factor for a graph G ...
openaire +1 more source
Canadian Journal of Mathematics, 1952
A graphGconsists of a non-null setVof objects called vertices together with a setEof objects called edges, the two sets having no common element. With each edge there are associated just two vertices, called its ends. Two or more edges may have the same pair of ends.
openaire +1 more source
A graphGconsists of a non-null setVof objects called vertices together with a setEof objects called edges, the two sets having no common element. With each edge there are associated just two vertices, called its ends. Two or more edges may have the same pair of ends.
openaire +1 more source
Journal of Combinatorial Optimization, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jian Cheng, Cun-Quan Zhang, Bao-Xuan Zhu
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jian Cheng, Cun-Quan Zhang, Bao-Xuan Zhu
openaire +1 more source
Discrete Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brian Alspach +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brian Alspach +2 more
openaire +1 more source