556 citations
- Rutgers, The State University of New JerseyUS5 papers
- Institute of Astronomy and Space PhysicsAR4 papers
- University of MariborSI4 papers
- Center for Astrophysics Harvard & SmithsonianUS3 papers
- Georgia State UniversityUS3 papers
- Goddard Space Flight CenterUS3 papers
- United States Naval Research LaboratoryUS3 papers
- California Institute of TechnologyUS2 papers
- Clemson UniversityUS2 papers
- College of CharlestonUS2 papers
- Institute of Mathematics, Physics, and MechanicsSI2 papers
- Michigan State UniversityUS2 papers
12 papers · 1 filter
Toroidal Cartesian Products Where One Factor is 3-Connected
Elizabeth Badgett, Christian Millichap, Kenta Noguchi
In this paper, we show that if is -connected, then the Cartesian product of graphs embeds on the torus if and only if is outer-cylindrical and is a pat…
The Edge-Product Space of Phylogenetic Trees is Not Shellable
Grace Stadnyk
The edge-product space of phylogenetic trees is a regular CW complex whose maximal closed cells correspond to trivalent trees with leaves labeled by a finite set . The face pose…
Embedding Grid Graphs on Surfaces
Christian Millichap, Fabian Salinas
In this paper, we analyze embeddings of grid graphs on orientable surfaces. We determine the genus of a large class of k-dimensional grid graphs and effective two-sided bounds for…
General -position sets
Sandi Klavzar, Douglas F. Rall, Ismael G. Yero
The general -position number of a graph is the cardinality of a largest set for which no three distinct vertices from lie on a common geodesic of len…
Packing chromatic vertex-critical graphs
Sandi Klavžar, Douglas F. Rall
The packing chromatic number of a graph is the smallest integer such that the vertex set of can be partitioned into sets , , where vertices in $…
On well-covered Cartesian products
Bert L. Hartnell, Douglas F. Rall, Kirsti Wash
In 1970, Plummer defined a well-covered graph to be a graph in which all maximal independent sets are in fact maximum. Later Hartnell and Rall showed that if the Cartesian prod…