Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Martin, Teichert"'
Autor:
Martin Sonntag, Hanns-Martin Teichert
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 44, Iss 1, p 101 (2024)
Externí odkaz:
https://doaj.org/article/ac4daa11ccde401294bed01480fc0c7d
Publikováno v:
Applications in Energy and Combustion Science, Vol 13, Iss , Pp 100098- (2023)
Power-to-X technologies that convert renewable electricity to chemically stored energy in “X” may provide a gaseous, liquid or solid fuel that can be used in winter to provide both, heat and electricity, and thus replace fossil fuels that are cur
Externí odkaz:
https://doaj.org/article/2448382bf63f4706976e45f76bb83e73
Autor:
Martin Teichert, Laura Milde, Annegret Holm, Laura Stanicek, Nicolas Gengenbacher, Soniya Savant, Tina Ruckdeschel, Zulfiyya Hasanov, Kshitij Srivastava, Junhao Hu, Stella Hertel, Arne Bartol, Katharina Schlereth, Hellmut G. Augustin
Publikováno v:
Nature Communications, Vol 8, Iss 1, Pp 1-12 (2017)
The angiopoietins regulate vascular maturation, angiogenesis and lymphangiogenesis via their Tie receptors that were long believed to be endothelium-specific. Here the authors show that angiopoietins activate and control pericyte function through per
Externí odkaz:
https://doaj.org/article/981a987e79e44cc08ee1f10a3f710c40
Autor:
Hanns-Martin Teichert, Martin Sonntag
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 1, Pp 279-295 (2020)
If D = (V, A) is a digraph, its niche hypergraph Nℋ(D) = (V, ℰ) has the edge set ℰ={e⊆V||e|≥2∧∃ υ∈V:e=ND−(υ)∨e=ND+(υ)}{\cal E} = \{ {e \subseteq V| | e | \ge 2 \wedge \exists \, \upsilon \in V:e = N_D^ - ( \upsilon ) \vee e = N
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d752cb535560f35ebe3cf9e6e45bf92c
https://doaj.org/article/7a12a4c89d0a4a729b0cdb3828d8bdff
https://doaj.org/article/7a12a4c89d0a4a729b0cdb3828d8bdff
Autor:
Martin Sonntag, Hanns-Martin Teichert
Publikováno v:
Opuscula Mathematica, Vol 30, Iss 2, Pp 179-191 (2010)
If \(D = (V,A)\) is a digraph, its domination hypergraph \(\mathcal{DH}(D) = (V,\mathcal{E})\) has the vertex set \(V\) and \(e \subseteq V\) is an edge of \(\mathcal{DH}(D)\) if and only if \(e\) is a minimal dominating set of \(D\). We investigate
Externí odkaz:
https://doaj.org/article/b38f034d0dbb477f8de84a1fa82a9a26
Autor:
Hanns-Martin Teichert, Martin Sonntag
Publikováno v:
Discussiones Mathematicae Graph Theory.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8098942e600e9dcdc6ecb4ee89200676
https://doi.org/10.7151/dmgt.2435
https://doi.org/10.7151/dmgt.2435
Autor:
Kshitij Srivastava, Annegret Holm, Nicolas Gengenbacher, Stella Hertel, Junhao Hu, Tina Ruckdeschel, Martin Teichert, Soniya Savant, Zulfiyya Hasanov, Katharina Schlereth, Laura Milde, Arne Bartol, Hellmut G. Augustin, Laura Stanicek
Publikováno v:
Nature Communications, Vol 8, Iss 1, Pp 1-12 (2017)
Nature Communications
Nature Communications
The Tie receptors with their Angiopoietin ligands act as regulators of angiogenesis and vessel maturation. Tie2 exerts its functions through its supposed endothelial-specific expression. Yet, Tie2 is also expressed at lower levels by pericytes and it
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cc3ba7ea1974b711e1ee07d40b58036a
https://doaj.org/article/981a987e79e44cc08ee1f10a3f710c40
https://doaj.org/article/981a987e79e44cc08ee1f10a3f710c40
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 36, Iss 4, Pp 819-832 (2016)
If D = (V,A) is a digraph, its niche hypergraph NH(D) = (V, E) has the edge set ℇ = {e ⊆ V | |e| ≥ 2 ∧ ∃ v ∈ V : e = N−D(v) ∨ e = N+D(v)}. Niche hypergraphs generalize the well-known niche graphs (see [11]) and are closely related to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c2fc3e6151a3aa532999fc5dcb399e85
https://doaj.org/article/76ea89c9477d48a4aa351c588c7f2f2b
https://doaj.org/article/76ea89c9477d48a4aa351c588c7f2f2b
Autor:
Martin Sonntag, Hanns-Martin Teichert
Publikováno v:
Graphs and Combinatorics. 31:2401-2412
We generalize the concept of exclusive sum labelings of graphs (cf. Miller et al., JCMCC 55:137---148, 2005) and determine the exclusive sum number for several classes of hypergraphs. The results disclose a significant difference between graphs (i.e.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd041c9a18955f0b74005b5c5d84b8fd
https://doi.org/10.1007/s00373-015-1525-6
https://doi.org/10.1007/s00373-015-1525-6
Autor:
Martin Sonntag, Hanns-Martin Teichert
Publikováno v:
Discrete Mathematics. 313(4):563-574
Let G = ( V , E ) be a simple undirected graph. The neighborhood hypergraph N ( G ) = ( V , E N ) of G has the edge set E N = { e ⊆ V ∣ | e | ≥ 1 ∧ ∃ x ∈ V : e = N G ( x ) } . In a certain sense, this is a generalization of the well-known
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c56893cd9ad1e8d36b8a012dbdfa04fb