Results 231 to 240 of about 839,618 (278)
How does self-compassion affect posttraumatic adaptation among lymphoma patients? A perspective based on network analysis. [PDF]
Eur J PsychotraumatolLi W, Xue D, Niu X, Chen Q, Wang X.
europepmc +1 more source
Computer-Based Design to Improve Bacillus thuringiensis Chitinase for Industrial Applications. [PDF]
ChemistryOpenSree Agash SG +5 more
europepmc +1 more source
Efficient service mesh traffic management for cloud-native applications. [PDF]
PLoS OneAhmed R, Ren S, Kim E, Lee C.
europepmc +1 more source
Evolve with your research: stepwise system evolution from document-driven to fact-centric research data management in materials science. [PDF]
J CheminformDudarev V, Ludwig A.
europepmc +1 more source
Detecting illicit transactions in bitcoin: a wavelet-temporal graph transformer approach for anti-money laundering. [PDF]
Sci RepLin Z +6 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
SIAM Journal on Discrete Mathematics, 1999
A property \(P\) of graphs is called monotone if it is preserved under the deletion of edges. Let \(\Delta^P_n\) denote the simplicial complex whose simplices are edge sets of \(n\)-vertex graphs having a monotone property \(P\). Topological properties of complexes of undirected graphs recently have been studied in a number of papers (see references in
Anders Björner, Volkmar Welker
openaire +1 more source
A property \(P\) of graphs is called monotone if it is preserved under the deletion of edges. Let \(\Delta^P_n\) denote the simplicial complex whose simplices are edge sets of \(n\)-vertex graphs having a monotone property \(P\). Topological properties of complexes of undirected graphs recently have been studied in a number of papers (see references in
Anders Björner, Volkmar Welker
openaire +1 more source
SIAM Journal on Discrete Mathematics, 1999
A ranking of a (di)graph is a colouring of the vertex set with positive integers in such a way that every (di)path between two vertices of the same colour has a vertex of larger colour. The \(k\)-ranking problem is as follows: given a (di)graph \(G\) and an integer \(k\), check whether \(G\) has a ranking with \(k\) colours. This problem is known to be
Jan Kratochvíl, Zsolt Tuza
openaire +2 more sources
A ranking of a (di)graph is a colouring of the vertex set with positive integers in such a way that every (di)path between two vertices of the same colour has a vertex of larger colour. The \(k\)-ranking problem is as follows: given a (di)graph \(G\) and an integer \(k\), check whether \(G\) has a ranking with \(k\) colours. This problem is known to be
Jan Kratochvíl, Zsolt Tuza
openaire +2 more sources
Journal of Graph Theory, 1992
AbstractWe give a new condition involving degrees sufficient for a digraph to be hamiltonian.
openaire +2 more sources
AbstractWe give a new condition involving degrees sufficient for a digraph to be hamiltonian.
openaire +2 more sources
Independent Directed Triangles in a Directed Graph
Graphs and Combinatorics, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources