R. Bruce Richter
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
R. Bruce Richter has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Alastair Farrugia
Malta
2 shared publications - C. Paul Bonnington
Monash University, Melbourne, VIC, Australia
2 shared publications - Gabriel Semanišin
Pavol Jozef Šafárik University in Košice, Faculty of Science
2 shared publications - Peter Mihók
Department of Applied Mathematics and Business Informatics, Faculty of Economics, Technical University Kovšice, 040 01 Košice, Slovakia
2 shared publications - Alastair Farrugia
Dept. of Combinatorics & Optimization University of Waterloo N2L 3G1 Ontario Canada
1 shared publication - Antoine Vella
Room D1464, UNODC, Vienna International Centre
1 shared publication
Latest Publications
- 10 July 2008
- Published by Wiley in Journal of Graph Theory
- Vol. 59 (2) , 115-144
Cycle spaces in topological spaces
We develop a general model of edge spaces in order to generalize, unify, and simplify previous work on cycle spaces of infinite graphs. We give simple topological criteria to show that the fundamental cycles of a (generalization of a) spanning tree generate the cycle space in a connected, compact, weakly Hausdorff edge space. Furthermore, in such a space, the orthogonal complement of the bond space is the cycle space. This work unifies the two different notions of cycle space as introduced by Diestel and Kühn [Combinatorica 24 (2004), 68–89 and Eur J Combin 25 (2004), 835–862] and by Bonnington and Richter [J Graph Theory 44 (2003), 132–147]. © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 115–144, 2008
- 10 July 2008
- Published by Wiley in Journal of Graph Theory
- Vol. 59 (2) , 115-144
Cycle spaces in topological spaces
We develop a general model of edge spaces in order to generalize, unify, and simplify previous work on cycle spaces of infinite graphs. We give simple topological criteria to show that the fundamental cycles of a (generalization of a) spanning tree generate the cycle space in a connected, compact, weakly Hausdorff edge space. Furthermore, in such a space, the orthogonal complement of the bond space is the cycle space. This work unifies the two different notions of cycle space as introduced by Diestel and Kühn [Combinatorica 24 (2004), 68–89 and Eur J Combin 25 (2004), 835–862] and by Bonnington and Richter [J Graph Theory 44 (2003), 132–147]. © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 115–144, 2008
- 10 July 2008
- Published by Wiley in Journal of Graph Theory
- Vol. 59 (2) , 162-176
The bond and cycle spaces of an infinite graph
- 10 July 2008
- Published by Wiley in Journal of Graph Theory
- Vol. 59 (2) , 162-176
The bond and cycle spaces of an infinite graph
- 14 June 2007
- Published by Wiley in Journal of Graph Theory
- Vol. 56 (2) , 128-134
The crossing number of K11 is 100
The crossing number of Kn is known for n ⩽ 10. We develop several simple counting properties that we shall exploit in showing by computer that cr(K11 = 100, which implies that cr(K12) = 150. We also determine the numbers of non‐isomorphic optimal drawings of K9 and K10. © 2007 Wiley Periodicals, Inc. J Graph Theory 56: 128–134, 2007
- 14 June 2007
- Published by Wiley in Journal of Graph Theory
- Vol. 56 (2) , 128-134
The crossing number of K11 is 100
The crossing number of Kn is known for n ⩽ 10. We develop several simple counting properties that we shall exploit in showing by computer that cr(K11 = 100, which implies that cr(K12) = 150. We also determine the numbers of non‐isomorphic optimal drawings of K9 and K10. © 2007 Wiley Periodicals, Inc. J Graph Theory 56: 128–134, 2007
- 20 October 2006
- Published by Wiley in Journal of Graph Theory
- Vol. 54 (2) , 125-153
Between ends and fibers
- 20 October 2006
- Published by Wiley in Journal of Graph Theory
- Vol. 54 (2) , 125-153
Between ends and fibers
- 14 September 2005
- Published by Wiley in Journal of Graph Theory
- Vol. 50 (3) , 234-245
Two maps with large representativity on one surface
- 14 September 2005
- Published by Wiley in Journal of Graph Theory
- Vol. 50 (3) , 234-245
Two maps with large representativity on one surface
- Open Access
- 14 September 2005
- Published by Wiley in Journal of Graph Theory
- Vol. 50 (3) , 261
Erratum to: Factorizations and characterizations of induced-hereditary and compositive properties
- 14 September 2005
- Published by Wiley in Journal of Graph Theory
- Vol. 50 (3) , 261
Open AccessErratum to: Factorizations and characterizations of induced-hereditary and compositive properties
- 25 February 2005
- Published by Wiley in Journal of Graph Theory
- Vol. 49 (1) , 11-27
Factorizations and characterizations of induced‐hereditary and compositive properties
An Erratum has been published for this article in Journal of Graph Theory 50:261, 2005.A graph property (i.e., a set of graphs) is hereditary (respectively, induced‐hereditary) if it is closed under taking subgraphs (resp., induced‐subgraphs), while the property is additive if it is closed under disjoint unions. If ${\cal P}$ and ${\cal Q}$ are properties, the product ${\cal P}\circ {\cal Q}$ consists of all graphs G for which there is a partition of the vertex set of G into (possibly empty) subsets A and B with G[A] $\in {\cal P}$ and G[B] $\in {\cal Q}$ . A property is reducible if it is the product of two other properties, and irreducible otherwise.We show that very few reducible induced‐hereditary properties have a unique factorization into irreducibles, and we describe them completely. On the other hand, we give a new and simpler proof that additive hereditary properties have a unique factorization into irreducible additive hereditary properties [J. Graph Theory 33 (2000), 44–53]. We also introduce analogs of additive induced‐hereditary properties, and characterize them in the style of Scheinerman [Discrete Math. 55 (1985), 185–193]. © 2005 Wiley Periodicals, Inc. J Graph Theory 49: 11–27, 2005- 25 February 2005
- Published by Wiley in Journal of Graph Theory
- Vol. 49 (1) , 11-27
Factorizations and characterizations of induced‐hereditary and compositive properties
An Erratum has been published for this article in Journal of Graph Theory 50:261, 2005.A graph property (i.e., a set of graphs) is hereditary (respectively, induced‐hereditary) if it is closed under taking subgraphs (resp., induced‐subgraphs), while the property is additive if it is closed under disjoint unions. If ${\cal P}$ and ${\cal Q}$ are properties, the product ${\cal P}\circ {\cal Q}$ consists of all graphs G for which there is a partition of the vertex set of G into (possibly empty) subsets A and B with G[A] $\in {\cal P}$ and G[B] $\in {\cal Q}$ . A property is reducible if it is the product of two other properties, and irreducible otherwise.We show that very few reducible induced‐hereditary properties have a unique factorization into irreducibles, and we describe them completely. On the other hand, we give a new and simpler proof that additive hereditary properties have a unique factorization into irreducible additive hereditary properties [J. Graph Theory 33 (2000), 44–53]. We also introduce analogs of additive induced‐hereditary properties, and characterize them in the style of Scheinerman [Discrete Math. 55 (1985), 185–193]. © 2005 Wiley Periodicals, Inc. J Graph Theory 49: 11–27, 2005- Open Access
- 2 January 2004
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 11 (1) , R25
Decomposing Infinite 2-Connected Graphs into 3-Connected Components
In the 1960's, Tutte presented a decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on 2-connected graphs to problems on 3-connected graphs. Motivated by a problem concerning accumulation points of infinite planar graphs, we generalize Tutte's decomposition to include all infinite 2-connected graphs.
- 2 January 2004
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 11 (1) , R25
Open AccessDecomposing Infinite 2-Connected Graphs into 3-Connected Components
In the 1960's, Tutte presented a decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on 2-connected graphs to problems on 3-connected graphs. Motivated by a problem concerning accumulation points of infinite planar graphs, we generalize Tutte's decomposition to include all infinite 2-connected graphs.
- 3 September 2003
- Published by Wiley in Journal of Graph Theory
- Vol. 44 (2) , 132-147
Graphs embedded in the plane with a bounded number of accumulation points
- 3 September 2003
- Published by Wiley in Journal of Graph Theory
- Vol. 44 (2) , 132-147
Graphs embedded in the plane with a bounded number of accumulation points
- Open Access
Unique factorisation of additive induced-hereditary properties
An additive hereditary graph property is a set of graphs, closed under isomorphism and under taking subgraphs and disjoint unions. Let ${\cal P}_1, >..., {\cal P}_n$ be additive hereditary graph properties. A graph $G$ has property $({\cal P}_1 \circ ... \circ {\cal P}_n)$ if there is a partition $(V_1, ..., V_n)$ of $V(G)$ into $n$ sets such that, for all $i$, the induced subgraph $G[V_i]$ is in ${\cal P}_i$. A property ${\cal P}$ is reducible if there are properties ${\cal Q}$, ${\cal R}$ such that ${\cal P} = {\cal Q} \circ {\cal R}$; otherwise it is irreducible. Mih\'{o}k, Semani\v{s}in and Vasky [J. Graph Theory {\bf 33} (2000), 44--53] gave a factorisation for any additive hereditary property ${\cal P}$ into a given number $dc({\cal P})$ of irreducible additive hereditary factors. Mih\'{o}k [Discuss. Math. Graph Theory {\bf 20} (2000), 143--153] gave a similar factorisation for properties that are additive and induced-hereditary (closed under taking induced-subgraphs and disjoint unions). Their results left open the possiblity of different factorisations, maybe even with a different number of factors; we prove here that the given factorisations are, in fact, unique.Open AccessUnique factorisation of additive induced-hereditary properties
An additive hereditary graph property is a set of graphs, closed under isomorphism and under taking subgraphs and disjoint unions. Let ${\cal P}_1, >..., {\cal P}_n$ be additive hereditary graph properties. A graph $G$ has property $({\cal P}_1 \circ ... \circ {\cal P}_n)$ if there is a partition $(V_1, ..., V_n)$ of $V(G)$ into $n$ sets such that, for all $i$, the induced subgraph $G[V_i]$ is in ${\cal P}_i$. A property ${\cal P}$ is reducible if there are properties ${\cal Q}$, ${\cal R}$ such that ${\cal P} = {\cal Q} \circ {\cal R}$; otherwise it is irreducible. Mih\'{o}k, Semani\v{s}in and Vasky [J. Graph Theory {\bf 33} (2000), 44--53] gave a factorisation for any additive hereditary property ${\cal P}$ into a given number $dc({\cal P})$ of irreducible additive hereditary factors. Mih\'{o}k [Discuss. Math. Graph Theory {\bf 20} (2000), 143--153] gave a similar factorisation for properties that are additive and induced-hereditary (closed under taking induced-subgraphs and disjoint unions). Their results left open the possiblity of different factorisations, maybe even with a different number of factors; we prove here that the given factorisations are, in fact, unique.