9 citations · 9 across the 1 of their papers we have counts for
4 papers · 1 filter
Total Difference Chromatic Numbers of Graphs
Ranjan Rohatgi, Yufei Zhang
Inspired by graceful labelings and total labelings of graphs, we introduce the idea of total difference labelings. A -total labeling of a graph is an assignment of disti…
Tilings of hexagons with a removed triad of bowties
Mihai Ciucu, Tri Lai, Ranjan Rohatgi
In this paper we consider arbitrary hexagons on the triangular lattice with three arbitrary bowtie-shaped holes, whose centers form an equilateral triangle. The number of lozenge t…
Connectivity at Infinity for the Braid Group of a Complete Bipartite Graph
Kristen Mazur, Jon McCammond, John Meier +1
The graph braid group of a complete bipartite graph is the fundamental group of a configuration space of points on the graph, which is a CAT(0) cube complex. We combine an analysis…
A shuffling theorem for lozenge tilings of doubly-dented hexagons
Tri Lai, Ranjan Rohatgi
MacMahon's theorem on plane partitions yields a simple product formula for tiling number of a hexagon, and Cohn, Larsen and Propp's theorem provides an explicit enumeration for til…