Results 241 to 250 of about 270,997 (279)

Determination of factors that allow cryogenic nanoscopy with high power illumination without devitrification. [PDF]

PLoS One
Huebinger J, Bastiaens PIH.
europepmc   +1 more source

Pharmacological targeting of RIG-I can selectively activate the integrated stress response. [PDF]

Sci Adv
Cuoco CA, Ren W, Baron KR, Gologo S, Perea V, Mathur P, Bora P, Ta A, Chu A, Aldakhlallah R, Rhoades D, Cole CM, Tan EP, Hou WC, Yoon L, Guo X, Rosarda JD, Baran PS, Kampmann M, Tillery L, Johnson KA, Powers ET, Wiseman RL, Kelly JW.   +23 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Directed Power Graphs

2021
In this article, first we introduce six types of power graphs related to a graph (or directed graph), with the help of set theory.Then we show that these newly defined power graphs are pairwise distinct by a few examples. Finally, we discuss the relation between Eulerian being the base graph and these six power graph types.
Mokhtarian Dehkordi, Elham, Eshaghi, Madjid, Moradi, Sirous, Yarahmadi, Zahra   +3 more
openaire   +1 more source

Powers of graphs

Proceedings of the sixteenth annual ACM symposium on Theory of computing - STOC '84, 1984
In this paper we investigate a powerful, and yet simple, technique for devising approximation algorithms for a wide variety of NP-complete problems in routing, location, and communication network design. Each of the algorithms presented here delivers an approximate solution guaranteed to be within a constant factor of the optimal solution. In addition,
Dorit S. Hochbaum, David B. Shmoys
openaire   +1 more source

Graphs whose powers are chordal and graphs whose powers are interval graphs

Journal of Graph Theory, 1997
The main theorem of this paper gives a forbidden induced subgraph condition on \(G\) that is sufficient for chordality of \(G^m\). This theorem is a generalization of a theorem of Balakrishnan and Paulraja who had provided this only for \(m=2\).
openaire   +2 more sources

Coloring Powers of Planar Graphs

SIAM Journal on Discrete Mathematics, 2003
Summary: We give nontrivial bounds for the inductiveness or degeneracy of power graphs \(G^{k}\) of a planar graph \(G\). This implies bounds for the chromatic number as well, since the inductiveness naturally relates to a greedy algorithm for vertex-coloring the given graph.
Agnarsson, Geir, Halldórsson, Magnús M.   +1 more
openaire   +3 more sources

On the Power of Graph Searching for Cocomparability Graphs

SIAM Journal on Discrete Mathematics, 2016
Summary: In this paper we study how graph searching on a cocomparability graph \(G\) can be used to produce cocomp orderings (i.e., orderings that are linear extensions of some transitive orientation of \(\overline{G}\)) that yield simple algorithms for various intractable problems in general.
Corneil, Derek G., Dusart, Jérémie, Habib, Michel, Köhler, Ekkerhard   +3 more
openaire   +2 more sources

Induced Matching Extendable Graph Powers

Graphs and Combinatorics, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources