Brian Alspach

dblp:a/BrianAlspach · DBLP profile ↗
← Back
8ranked-venue papers
7as first author
1since 2021 · last 2024
0000-0002-1034-3993ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 6 · 5 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author
YearPublicationVenuePosition
2024 On the 2-spanning cyclability of honeycomb toroidal graphs
abstract
A graph X is 2-spanning cyclable if for any pair of distinct vertices u and v there is a 2-factor of X consisting of two cycles such that u and v belong to distinct cycles. In this paper we examine the 2-spanning cyclability of honeycomb toroidal graphs.
Brian Alspach
Discret. Appl. Math.1
2009 Honeycomb toroidal graphs are Cayley graphs
Brian Alspach, Matthew Dean
Inf. Process. Lett.1
2008 Time constrained graph searching
Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang
Theor. Comput. Sci.1
2007 Arc Searching Digraphs Without Jumping
Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang
COCOA1
2004 Sweeping Graphs with Large Clique Number
Boting Yang, Danny Dyer, Brian Alspach
ISAAC3
1996 Nowhere-Zero 4-Flows and Cayley Graphs on Solvable Groups
abstract
We prove that every Cayley graph on a finite solvable group admits a nowhere-zero 4-flow. In particular, every cubic Cayley graph on a solvable group is 3-edge-colorable.
Brian Alspach, Yi-Ping Liu, Cun-Quan Zhang
SIAM J. Discret. Math.1
1992 Cayley Graphs with Optimal Fault Tolerance
abstract
If H is a quasiminimal generating set for a finite group G, it is proved that the Cayley graph (G; H) has optimal fault tolerance unless it belongs to a special family.>
Brian Alspach
IEEE Trans. Computers1
1983 A lower-bound for the number of productions required for a certain class of languages
Brian Alspach, Peter Eades, Gordon Rose
Discret. Appl. Math.1