This paper aims to give a brief introduction to a set of problems, old and new, concerned with one of the main and long-standing quests in infinite graph theory: how to represent the end structure of a given graph by that of a simpler subgraph, in particular a spanning tree. There has been a fair am
β¦ LIBER β¦
Point vortex dynamics: recent results and open problems
β Scribed by Hassan Aref; James B. Kadtke; Ireneusz Zawadzki; Laurence J. Campbell; Bruno Eckhardt
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 836 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0169-5983
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The end structure of a graph: recent res
β
Reinhard Diestel
π
Article
π
1992
π
Elsevier Science
π
English
β 1022 KB
A survey: Recent results, conjectures, a
β
Joseph A. Gallian
π
Article
π
1989
π
John Wiley and Sons
π
English
β 752 KB
In this paper we organize and summarize much of the work done on graceful and harmonious labelings of graphs. Many open problems and conjectures are included.
Some recent problems and results in grap
β
Paul ErdΓΆs
π
Article
π
1997
π
Elsevier Science
π
English
β 230 KB
I will mention two of my favourite problems in which recently important progress was made. The other questions I will mention are perhaps less well known. 1. Faber, Lowisz and I conjectured more than 20 years ago that if Gi, 1 <<.i~n are n G n edge disjoint complete graphs of size n then Ui=l i has
Recent progress and outstanding problems
β
R.S. MacKay
π
Article
π
1995
π
Elsevier Science
π
English
β 870 KB
Identifiability of factor analysis: Some
β
Alexander Shapiro
π
Article
π
1989
π
Elsevier Science
π
English
β 50 KB
Identifiability of factor analysis: some
β
Alexander Shapiro
π
Article
π
1985
π
Elsevier Science
π
English
β 390 KB