4 citations · 5 across the 2 of their papers we have counts for
3 papers
The tripartite-circle crossing number of graphs with two small partition classes
Charles Camacho, Silvia Fernández-Merchant, Marija Jelić Milutinović +4
A tripartite-circle drawing of a tripartite graph is a drawing in the plane, where each part of a vertex partition is placed on one of three disjoint circles, and the edges do not…
Bounding the tripartite-circle crossing number of complete tripartite graphs
Charles Camacho, Silvia Fernández-Merchant, Marija Jelić Milutinović +4
A tripartite-circle drawing of a tripartite graph is a drawing in the plane, where each part of a vertex partition is placed on one of three disjoint circles, and the edges do not…
On the Strong Chromatic Index of Sparse Graphs
Philip DeOrsey, Jennifer Diemunsch, Michael Ferrara +7
The strong chromatic index of a graph , denoted , is the least number of colors needed to edge-color so that edges at distance at most two receive distinct colors.…