Robertson, Neil 1938
Overview
Works:  62 works in 119 publications in 2 languages and 764 library holdings 

Genres:  Conference papers and proceedings History Guitar music (Blues) Blues (Music) Bluesrock music 
Roles:  Author, Editor, Other, Performer 
Classifications:  QA166, 511.5 
Publication Timeline
.
Most widely held works by
Neil Robertson
Graph structure theory : proceedings of the AMSIMSSIAM Joint Summer Research Conference on Graph Minors, held June 22 to
July 5, 1991, with support from the National Science Foundation and the Office of Naval Research by AMSIMSSIAM Joint summer research conference on Graph Minors(
Book
)
15 editions published between 1991 and 1993 in English and held by 260 WorldCat member libraries worldwide
15 editions published between 1991 and 1993 in English and held by 260 WorldCat member libraries worldwide
Excluding infinite clique minors by
Neil Robertson(
Book
)
13 editions published in 1995 in English and held by 224 WorldCat member libraries worldwide
13 editions published in 1995 in English and held by 224 WorldCat member libraries worldwide
The open garden : Australian gardens and their gardeners by
Louise Earwaker(
Book
)
1 edition published in 2000 in English and held by 62 WorldCat member libraries worldwide
1 edition published in 2000 in English and held by 62 WorldCat member libraries worldwide
A garden of my own by
Louise Earwaker(
Book
)
1 edition published in 2003 in English and held by 30 WorldCat member libraries worldwide
1 edition published in 2003 in English and held by 30 WorldCat member libraries worldwide
An outline of a disjoint path algorithm by
Neil Robertson(
Book
)
7 editions published between 1988 and 1989 in 3 languages and held by 10 WorldCat member libraries worldwide
7 editions published between 1988 and 1989 in 3 languages and held by 10 WorldCat member libraries worldwide
Pavement management systems national pavement indicators by
Austroads(
Book
)
1 edition published in 1990 in English and held by 8 WorldCat member libraries worldwide
1 edition published in 1990 in English and held by 8 WorldCat member libraries worldwide
Seattle graph minors : proceedings of the Joint Summer Research Conference on Graph Minors, held June 22 to July 5, 1991,
at the University of Washington, Seattle, with support from the National Science Foundation and the Office of Naval Research by Joint Summer Research Conference on Graph Minors(
Book
)
1 edition published in 1993 in English and held by 5 WorldCat member libraries worldwide
1 edition published in 1993 in English and held by 5 WorldCat member libraries worldwide
Neil Robertson by
Neil Robertson(
)
in English and held by 4 WorldCat member libraries worldwide
"Welcome to neilrobertson.net, the official web site of Australian snooker professional Neil Robertson."Homepage
in English and held by 4 WorldCat member libraries worldwide
"Welcome to neilrobertson.net, the official web site of Australian snooker professional Neil Robertson."Homepage
Real world Adobe GoLive 4 by
Jeff Carlson(
Book
)
2 editions published in 2000 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 2000 in English and held by 4 WorldCat member libraries worldwide
Quickly excluding a planar graph by
Neil Robertson(
Book
)
2 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide
Abstract: "In an earlier paper, the first two authors proved that for any planar graph, H, every graph with no minor isomorphic to H has bounded treewidth; but the bound given there was enormous. Here we prove a much better bound, with a simpler proof."
2 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide
Abstract: "In an earlier paper, the first two authors proved that for any planar graph, H, every graph with no minor isomorphic to H has bounded treewidth; but the bound given there was enormous. Here we prove a much better bound, with a simpler proof."
Unitdistance graphs in Euclidean spaces by Kiran Babu Chilakamarri(
)
2 editions published in 1990 in English and held by 3 WorldCat member libraries worldwide
The unitdistance graph in ndimensional Euclidean space is the infinite graph with vertex set all the points in nspace and with two vertices adjacent if and only if the Euclidean distance between them is exactly 1. The rational unitdistance graph in rational nspace is the subgraph of unitdistance graph induced by the rational points. It is shown that the rational unitdistance graphs are connected if and only if the dimension of the space is at least five. The clique numbers of the rational unitdistance graphs are evaluated (modulo the existence of the solution of a Diophantine equation). The chromatic numbers of the rational unitdistance graphs up to dimension five are discussed. The unitdistance graph problem is considered in Minkowski Metric spaces by replacing the Euclidean distance by the Minkowski distance. We obtain the same bounds for the chromatic number of the Minkowski plane as that for the Euclidean plane. Several constructions of dense, infinite (locally uncountable) bipartite subgraphs of the Euclidean plane are given. A characterization of finite subgraphs of the unitdistance graphs in ndimensional Euclidean in terms of ndimensional integer lattice points is given
2 editions published in 1990 in English and held by 3 WorldCat member libraries worldwide
The unitdistance graph in ndimensional Euclidean space is the infinite graph with vertex set all the points in nspace and with two vertices adjacent if and only if the Euclidean distance between them is exactly 1. The rational unitdistance graph in rational nspace is the subgraph of unitdistance graph induced by the rational points. It is shown that the rational unitdistance graphs are connected if and only if the dimension of the space is at least five. The clique numbers of the rational unitdistance graphs are evaluated (modulo the existence of the solution of a Diophantine equation). The chromatic numbers of the rational unitdistance graphs up to dimension five are discussed. The unitdistance graph problem is considered in Minkowski Metric spaces by replacing the Euclidean distance by the Minkowski distance. We obtain the same bounds for the chromatic number of the Minkowski plane as that for the Euclidean plane. Several constructions of dense, infinite (locally uncountable) bipartite subgraphs of the Euclidean plane are given. A characterization of finite subgraphs of the unitdistance graphs in ndimensional Euclidean in terms of ndimensional integer lattice points is given
Good to go by
John Campbelljohn(
Recording
)
3 editions published in 2009 in English and held by 3 WorldCat member libraries worldwide
3 editions published in 2009 in English and held by 3 WorldCat member libraries worldwide
On acyclic colorings of graphs on surfaces by
Bojan Mohar(
Book
)
3 editions published in 1994 in English and held by 3 WorldCat member libraries worldwide
3 editions published in 1994 in English and held by 3 WorldCat member libraries worldwide
Planar graphs on nonplanar surfaces by
Bojan Mohar(
Book
)
3 editions published in 1995 in English and held by 3 WorldCat member libraries worldwide
3 editions published in 1995 in English and held by 3 WorldCat member libraries worldwide
Seymour's selfminor conjecture for infinite graphs by Bogdan Stanislaw Oporowski(
)
2 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide
Paul Seymour conjectured that every infinite graph is isomorphic to a proper minor of itself. This conjecture has a strong relationship to the wellquasiordering of graphs under the minor relation; in the still open countable case it easily implies the RobertsonSeymour result about wellquasiordering of finite graphs (known before as the Wagner conjecture), and for graphs with infinitely many finite connected components the validity of the conjecture easily follows from the RobertsonSeymour result
2 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide
Paul Seymour conjectured that every infinite graph is isomorphic to a proper minor of itself. This conjecture has a strong relationship to the wellquasiordering of graphs under the minor relation; in the still open countable case it easily implies the RobertsonSeymour result about wellquasiordering of finite graphs (known before as the Wagner conjecture), and for graphs with infinitely many finite connected components the validity of the conjecture easily follows from the RobertsonSeymour result
The good ship Maquinna by
Neil Robertson(
Book
)
2 editions published in 2000 in English and held by 3 WorldCat member libraries worldwide
2 editions published in 2000 in English and held by 3 WorldCat member libraries worldwide
Representativity of surface embeddings by
Neil Robertson(
Book
)
2 editions published in 1989 in German and English and held by 3 WorldCat member libraries worldwide
2 editions published in 1989 in German and English and held by 3 WorldCat member libraries worldwide
Disjoint essential cycles by
Bojan Mohar(
Book
)
3 editions published in 1995 in English and held by 3 WorldCat member libraries worldwide
3 editions published in 1995 in English and held by 3 WorldCat member libraries worldwide
The MFA and beyond : a preliminary assessment by
Neil Robertson(
Book
)
2 editions published in 1986 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1986 in English and held by 2 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Seymour, Paul D. Other Editor
 National Science Foundation (U.S.) Other
 Thomas, Robin 1962
 United States Office of Naval Research Other
 Earwaker, Louise Author
 Joint Summer Research Conference on Graph Minors. <1991, Seattle, Wash.>.
 Mohar, Bojan Author
 University of Edinburgh
 American Mathematical Society
 Fleishman, Glenn
Useful Links
Associated Subjects
Adobe GoLive Arrangement Regarding International Trade in Textiles (1973) Australia British Columbia British ColumbiaPacific Coast Clothing tradeEconomic aspects Clothing tradeVocational guidance Coastwise shipping Gardeners Gardening Gardens Graph theory Landscape gardening PavementsDesign and construction PavementsMaintenance and repair PavementsMaintenance and repairManagement PavementsPerformanceEvaluation ScotlandStrathclyde Ships Snooker Snooker players Soldiers Steamboat lines Steamboats Textile industryEconomic aspects Topological graph theory Web publishing Web sitesAuthoring programs Web sitesDesign Western Australia
Alternative Names
Neil Robertson Amerikaans wiskundige
Neil Robertson amerikansk matematikar
Neil Robertson amerikansk matematiker
Neil Robertson mathématicien américain
Neil Robertson USamerikanischer Mathematiker
Robertson, N.
نیل رابرتسون ریاضیدان آمریکایی
Languages
Covers