نتایج جستجو برای: gerhard emmanuel

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

Journal: :Clinical Orthopaedics & Related Research 2019

Journal: :Central European History 2015

Journal: :Anales de Historia del Arte 2012

Journal: :İnönü Üniversitesi Kültür ve Sanat Dergisi 2018

Journal: :Württembergisch Franken 2023

Anna Moraht- Fromm, Gerhard Weilandt (Hrsgg.), Unter der Lupe. Neue Forschungen zu Skulptur und Malerei des Hoch- Spätmittelalters. Festschrift für Hans Westhoff zum 60 Geburtstag, Stuttgart/Ulm (Thorbecke, Süddeutsche Verlagsgesellschaft) 2000. 352 S., zahlr. Abb.

2006

This is an overview article on finite-dimensional algebras and quivers, written for the Encyclopedia of Mathematical Physics. We cover path algebras, Ringel-Hall algebras and the quiver varieties of Lusztig and Nakajima.

Journal: :Journal of Graph Theory 2015
Daniel W. Cranston Yu-Chang Liang Xuding Zhu

An antimagic labeling of a graph G with m edges is a bijection from E(G) to {1, 2, . . . ,m} such that for all vertices u and v, the sum of labels on edges incident to u differs from that for edges incident to v. Hartsfield and Ringel conjectured that every connected graph other than the single edge K2 has an antimagic labeling. We prove this conjecture for regular graphs of odd degree.

Journal: :Discrete Mathematics & Theoretical Computer Science 2009
Artur Szymanski A. Pawel Wojda

A k-uniform hypergraphH = (V ;E) is said to be self-complementary whenever it is isomorphic with its complement H = (V ; ` V k ́ −E). Every permutation σ of the set V such that σ(e) is an edge ofH if and only if e ∈ E is called selfcomplementing. 2-self-comlementary hypergraphs are exactly self complementary graphs introduced independently by Ringel (1963) and Sachs (1962). For any positive inte...

Journal: :Australasian J. Combinatorics 2015
Mari F. Castle Evan D. Moore Erik E. Westlund

For a tree T , the graph X is T -decomposable if there exists a partition of the edge set of X into isomorphic copies of T . In 1963, Ringel conjectured that K2m+1 can be decomposed by any tree with m edges. Graham and Häggkvist conjectured more generally that every 2m-regular graph can be decomposed by any tree with m edges. Fink showed in 1994 that for any directed tree T with m arcs, the dir...

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

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