Richter, Bruce 1957
Overview
Works:  24 works in 39 publications in 1 language and 55 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author 
Publication Timeline
.
Most widely held works by
Bruce Richter
3connected planar spaces uniquely embed in the sphere by
R. Bruce Richter(
Book
)
4 editions published in 2001 in English and held by 6 WorldCat member libraries worldwide
4 editions published in 2001 in English and held by 6 WorldCat member libraries worldwide
Cycle spaces in topological spaces by
Antoine Vella(
Book
)
4 editions published in 2005 in English and held by 5 WorldCat member libraries worldwide
4 editions published in 2005 in English and held by 5 WorldCat member libraries worldwide
The topology of embedded graphs by
R. Bruce Richter(
Book
)
6 editions published between 1983 and 1985 in English and held by 4 WorldCat member libraries worldwide
This thesis is about graphs embedded in surfaces, both orientable and nonorientable. The definition of embedding is topological; the edges of an embedded graph are curves to a 2dimensional manifold. This topological definition is treated topologically so as to bring out certain combinatorial features. The embedding is shown to induce a cyclic rotation of edges about each vertex; the boundary walks are defined. Combinatorial conditions are given as to when two embeddings are topologically equivalent. Certain sequences of corners correspond to boundary walks, while others correspond to the cyclic rotations. Corners figure prominently in a combinatorial discussion of orientable surfaces
6 editions published between 1983 and 1985 in English and held by 4 WorldCat member libraries worldwide
This thesis is about graphs embedded in surfaces, both orientable and nonorientable. The definition of embedding is topological; the edges of an embedded graph are curves to a 2dimensional manifold. This topological definition is treated topologically so as to bring out certain combinatorial features. The embedding is shown to induce a cyclic rotation of edges about each vertex; the boundary walks are defined. Combinatorial conditions are given as to when two embeddings are topologically equivalent. Certain sequences of corners correspond to boundary walks, while others correspond to the cyclic rotations. Corners figure prominently in a combinatorial discussion of orientable surfaces
Minimal graphs with crossing number at least k by
Bruce Richter(
Book
)
1 edition published in 1991 in English and held by 4 WorldCat member libraries worldwide
1 edition published in 1991 in English and held by 4 WorldCat member libraries worldwide
The crossing number of K3,n in a surface by
Bruce Richter(
Book
)
2 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
On the existence of essential cycles in embedded graphs by
Bruce Richter(
Book
)
1 edition published in 1991 in English and held by 4 WorldCat member libraries worldwide
1 edition published in 1991 in English and held by 4 WorldCat member libraries worldwide
Walks through every edge exactly twice by
Bruce Richter(
Book
)
1 edition published in 1991 in English and held by 4 WorldCat member libraries worldwide
1 edition published in 1991 in English and held by 4 WorldCat member libraries worldwide
Hamiltonicity in 5connected toroidal triangulations by
Richard Brunet(
Book
)
1 edition published in 1992 in English and held by 4 WorldCat member libraries worldwide
1 edition published in 1992 in English and held by 4 WorldCat member libraries worldwide
Planar graphs without 3cycles and with 4cycles far apart are 3choosable by Matthew Sullivan(
Book
)
1 edition published in 2016 in English and held by 3 WorldCat member libraries worldwide
A graph G is said to be Lcolourable if for a given list assignment L = {L(v)v [is in] V (G)} there is a proper colouring c of G such that c(v) [is in] L(v) for all v in V (G). If G is Lcolourable for all L with L(v) [greater than or equal to] k for all v in V (G), then G is said to be kchoosable. This paper focuses on two different ways to prove list colouring results on planar graphs. The first method will be discharging, which will be used to fuse multiple results into one theorem. The second method will be restricting the lists of vertices on the boundary and applying induction, which will show that planar graphs without 3 cycles and 4cycles distance 8 apart are 3choosable
1 edition published in 2016 in English and held by 3 WorldCat member libraries worldwide
A graph G is said to be Lcolourable if for a given list assignment L = {L(v)v [is in] V (G)} there is a proper colouring c of G such that c(v) [is in] L(v) for all v in V (G). If G is Lcolourable for all L with L(v) [greater than or equal to] k for all v in V (G), then G is said to be kchoosable. This paper focuses on two different ways to prove list colouring results on planar graphs. The first method will be discharging, which will be used to fuse multiple results into one theorem. The second method will be restricting the lists of vertices on the boundary and applying induction, which will show that planar graphs without 3 cycles and 4cycles distance 8 apart are 3choosable
Lower bounds for the crossing numbers of graphs by
R. B Richter(
Book
)
2 editions published in 1993 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1993 in English and held by 2 WorldCat member libraries worldwide
Graphs and algorithms : Joint summer research conference in the mathematical sciences : Papers by
AMSIMSSIAM Joint Summer Research Conference in the Mathematical Sciences on Graphs and Algorithms(
Book
)
2 editions published in 1989 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1989 in English and held by 2 WorldCat member libraries worldwide
Embedding grids in surfaces by
James F Geelen(
Book
)
1 edition published in 2000 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2000 in English and held by 2 WorldCat member libraries worldwide
Cayley maps(
Book
)
1 edition published in 2001 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2001 in English and held by 2 WorldCat member libraries worldwide
Cycle spaces in topological spaces by
Antonio Vella(
Book
)
1 edition published in 2005 in English and held by 1 WorldCat member library worldwide
1 edition published in 2005 in English and held by 1 WorldCat member library worldwide
Walks through every edge exactly twice by
Jennifer Keir(
Book
)
1 edition published in 1992 in English and held by 1 WorldCat member library worldwide
1 edition published in 1992 in English and held by 1 WorldCat member library worldwide
On the existence of essential cycles in embedded graphs by
R. Bruce Richter(
Book
)
1 edition published in 1991 in English and held by 1 WorldCat member library worldwide
1 edition published in 1991 in English and held by 1 WorldCat member library worldwide
Two highly representative maps on one surface by
Bruce Richter(
Book
)
1 edition published in 2003 in English and held by 1 WorldCat member library worldwide
1 edition published in 2003 in English and held by 1 WorldCat member library worldwide
Minimal graphs with crossing number at least k by
R. Bruce Richter(
Book
)
1 edition published in 1991 in English and held by 1 WorldCat member library worldwide
1 edition published in 1991 in English and held by 1 WorldCat member library worldwide
Walks through every edge exactly twice by
J. Bruce Richter(
Book
)
1 edition published in 1991 in English and held by 1 WorldCat member library worldwide
1 edition published in 1991 in English and held by 1 WorldCat member library worldwide
Arrangements, circular arrangements and the crossing number of C₇ x C[subscript n] by
Jay M. H Adamsson(
Book
)
1 edition published in 2001 in English and held by 1 WorldCat member library worldwide
1 edition published in 2001 in English and held by 1 WorldCat member library worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Carleton University Department of Mathematics and Statistics
 University of Waterloo Department of Combinatorics and Optimization
 Thomassen, Carsten
 University of Waterloo Faculty of Mathematics
 Vitray, R. P.
 Brunet, Richard 1963 Author
 Vella, Antoine Author
 Širáň, J.
 Sullivan, Matthew Author
 Salazar, G. (Gelasio) 1969