نتایج جستجو برای: an eulerian

تعداد نتایج: 5686135  

Journal: :IEEE Transactions on Medical Imaging 2003

Journal: :Journal of Geophysical Research: Oceans 2019

Journal: :Journal of the Korea Society of Computer and Information 2016

Journal: :Eur. J. Comb. 2017
Nicolas Bonichon Mireille Bousquet-Mélou Paul Dorbec Claire Pennarun

The number of planar Eulerian maps with n edges is well-known to have a simple expression. But what is the number of planar Eulerian orientations with n edges? This problem appears to be difficult. To approach it, we define and count families of subsets and supersets of planar Eulerian orientations, indexed by an integer k, that converge to the set of all planar Eulerian orientations as k incre...

Journal: :SIAM J. Discrete Math. 2013
James M. Carraher Stephen G. Hartke

Let G be an eulerian digraph with a fixed edge coloring (not necessarily a proper edge coloring). A compatible circuit of G is an eulerian circuit such that every two consecutive edges in the circuit have different colors. We characterize the existence of compatible circuits for directed graphs avoiding certain vertices of outdegree three. Our result is analogous to a result of Kotzig for compa...

Journal: :Discrete Mathematics 2006
Weiqi Luo Zhi-Hong Chen Wei-Guo Chen

A graph G is Eulerian-connected if for any u and v in V (G), G has a spanning (u. v)-trail. A graph G is edge-Eulerian-connected if for any e' and elf in E(G), G has a spanning (e', elf)-trail. For an integer r ~ 0, a graph is called r-Eulerian-connected if for any X s::: E(G) with IXI ~r, and for any u, v E V(G), G has a spanning (u, v)-trail T such that X s::: E(T). The r-edge-Eulerian­ conne...

2010
Mu-Tsun Tsai Douglas B. West Michael O. Albertson

Using the existence of noncrossing Eulerian circuits in Eulerian plane graphs, we give a short constructive proof of the theorem of Heawood that Eulerian triangulations are 3-colorable.

Journal: :Int. J. Math. Mathematical Sciences 2012
Daeyeoul Kim Min-Soo Kim

Kim et al. 2012 introduced an interesting p-adic analogue of the Eulerian polynomials. They studied some identities on the Eulerian polynomials in connection with the Genocchi, Euler, and tangent numbers. In this paper, by applying the symmetry of the fermionic p-adic q-integral on Zp, defined by Kim 2008 , we show a symmetric relation between the q-extension of the alternating sum of integer p...

Journal: :CoRR 2015
Oliver Knill

d-spheres are defined graph theoretically and inductively as the empty graph in dimension d = −1 and d-dimensional graphs for which all unit spheres S(x) are (d−1)-spheres and such that for d ≥ 0 the removal of one vertex renders the graph contractible. Eulerian d-spheres are geometric d-spheres which can be colored with d + 1 colors. They are Eulerian graphs in the classical sense and for d ≥ ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید