Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Jens Schreyer"'
Publikováno v:
European Journal of Mathematics. 1:186-197
We show that the strong total Thue chromatic number $$\pi _\mathrm{T}(G) < 15\mathrm{\Delta }^2$$ for a graph $$G$$ with maximum degree $$\mathrm{\Delta }\ge 3$$ , and establish some other upper bounds for the weak and strong total Thue chromatic num
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9abf3cd8939a58e6a0330982241bc3ed
https://doi.org/10.1007/s40879-014-0016-2
https://doi.org/10.1007/s40879-014-0016-2
Publikováno v:
Discrete Mathematics. 307:1538-1544
Let x be a vertex of a simple graph G. The vertex-type of x is the lexicographically ordered degree sequence of its neighbors. We call the graph G vertex-oblique if there are no two vertices in V(G) which are of the same vertex-type. We will show tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d4bfeeb1281ad12572e5d16d0d41eb39
https://doi.org/10.1016/j.disc.2005.11.091
https://doi.org/10.1016/j.disc.2005.11.091
Autor:
Jens Schreyer, Hansjoachim Walther
Publikováno v:
Discrete Applied Mathematics. 136:315-327
Extended Abstract By Download : Download full-size image we denote the set of polyhedral graphs, and let G = G(V, E, F) ∈ Download : Download full-size image .The degree d(x) of a vertex × ∈ V(G) is the number of edges incident with x. The degre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::99385d828a0435a830001af0ff19404a
https://doi.org/10.1016/s0166-218x(03)00447-5
https://doi.org/10.1016/s0166-218x(03)00447-5
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 38, Iss 3, Pp 635-643 (2018)
A sequence is called non-repetitive if no of its subsequences forms a repetition (a sequence $r_1,r_2,\dots,r_{2n}$ such that $r_i=r_{n+i}$ for all $1\leq i \leq n$). Let $G$ be a graph whose vertices are coloured. A colouring $\varphi$ of the graph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c8f7a850265e7c917c531341873ca1ea
http://arxiv.org/abs/1409.5154
http://arxiv.org/abs/1409.5154
Publikováno v:
NetSys
Network coordinate systems have gained much attention as they allow for an elegant estimation of distances between nodes in distributed systems. Their most prominent representative is Vivaldi, which is using a mass-spring-damper system to embed peers
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::770a0e811b84a376f24ccc610f2eae65
https://doi.org/10.1109/netsys.2013.21
https://doi.org/10.1109/netsys.2013.21
Let G be a plane graph. A vertex-colouring $$\varphi $$? of G is called facial non-repetitive if for no sequence $$r_1 r_2 \ldots r_{2n}$$r1r2?r2n, $$n\ge 1$$n?1, of consecutive vertex colours of any facial path it holds $$r_i=r_{n+i}$$ri=rn+i for al
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a6cd756ebe58533dc272f6060485d663
Publikováno v:
Autonomous Systems: Developments and Trends ISBN: 9783642248054
Autonomous Systems: Developments and Trends
Autonomous Systems: Developments and Trends
We consider stochastic cellular automata and use a theory developed by H. Peyton Young to analyze semi-steady states in such automata.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::69b8502e6c554a33e83f01f6661346d4
https://doi.org/10.1007/978-3-642-24806-1_24
https://doi.org/10.1007/978-3-642-24806-1_24
Publikováno v:
Discussiones Mathematicae Graph Theory. 22:39
A k-gon alpha of a polyhedral graph G(V,E,F) is of type if the vertices incident with alpha in cyclic order have degrees b1, b2,...,bk and $ is the lexicographic minimum of all such sequences available for alpha. A polyhedral graph G is oblique if it
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ebb63a1bf8fc8921f69d9ade35c5dab
https://doi.org/10.7151/dmgt.1157
https://doi.org/10.7151/dmgt.1157