Results 271 to 280 of about 47,947 (303)
Upcycling of LiFePO<sub>4</sub> to high-performance LiMn <sub><i>x</i></sub> Fe<sub>1-<i>x</i></sub> PO<sub>4</sub>: activating the Mn redox platform for stable energy storage. [PDF]
Chem SciZeng Z, Qi X, Sun W, Ge P, Yang Y.
europepmc +1 more source
Research on Simulation of Fatigue Crack Growth in LNG Storage Tanks and Prediction of Residual Service Life. [PDF]
Materials (Basel)Zhang Q, Yi X, Li Z, Zhou W, Liu J.
europepmc +1 more source
Controlled oxidation levels in graphene oxide to achieve forming-free and analog resistive switching in RRAM. [PDF]
Sci RepMoazzeni A +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Modularity of cycles and paths in graphs
Journal of the ACM, 1991Certain problems related to the length of cycles and paths modulo a given integer are studied. Linear-time algorithms are presented that determine whether all cycles in an undirected graph are of length P mod Q and whether all paths between two specified nodes are of length P
Esther M. Arkin +2 more
exaly +2 more sources
Algorithms to count paths and cycles
Information Processing Letters, 1994zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +2 more sources
On Hamiltonian alternating cycles and paths [PDF]
Computational Geometry: Theory and Applications, 2018 We undertake a study on computing Hamiltonian alternating cycles and paths on bicolored point sets. This has been an intensively studied problem, not always with a solution, when the paths and cycles are also required to be plane. In this paper, we relax
Mercè Claverol +2 more
exaly +2 more sources
Journal of Graph Theory, 2011
AbstractIn 1960 Ore proved the following theorem: Let G be a graph of order n. If d(u) + d(v)≥n for every pair of nonadjacent vertices u and v, then G is hamiltonian. Since then for several other graph properties similar sufficient degree conditions have been obtained, so‐called “Ore‐type degree conditions”. In [R. J. Faudree, R. H. Schelp, A.
Jochen Harant +3 more
openaire +2 more sources
AbstractIn 1960 Ore proved the following theorem: Let G be a graph of order n. If d(u) + d(v)≥n for every pair of nonadjacent vertices u and v, then G is hamiltonian. Since then for several other graph properties similar sufficient degree conditions have been obtained, so‐called “Ore‐type degree conditions”. In [R. J. Faudree, R. H. Schelp, A.
Jochen Harant +3 more
openaire +2 more sources
Cycles and paths in multigraphs [PDF]
Australas. J Comb., 1992 Let \({\mathbf d}=(d_ 1,d_ 2,\dots,d_ n)\) be a sequence of \(n\) nonnegative integers. If there is a multigraph (without loops) \(G\) with vertex set \(\{v_ i:i=1,2,\dots,n\}\) such that the degree of \(v_ i\) is \(d_ i\) for \(i=1,2,\dots,n\), \({\mathbf d}\) will be called a degree sequence and we say that it has the realization \(G\). A realization
Roger B. Eggleton +2 more
openaire +1 more source
Journal of Graph Theory, 1978
AbstractLet k be a positive integer, and S a nonempty set of positive integers. Suppose that G is a connected graph containing a path of length k, and that each path P of length k in G is contained in some cycle C(P) of length s ∈ S. We prove that every path of length less than k can be extended to a path of length k in G.
openaire +2 more sources
AbstractLet k be a positive integer, and S a nonempty set of positive integers. Suppose that G is a connected graph containing a path of length k, and that each path P of length k in G is contained in some cycle C(P) of length s ∈ S. We prove that every path of length less than k can be extended to a path of length k in G.
openaire +2 more sources
Hamilton Cycles and Paths in Fullerenes
Journal of Chemical Information and Modeling, 2007AbstractChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 200 leading journals. To access a ChemInform Abstract, please click on HTML or PDF.
openaire +2 more sources