3 papers
cs.CG2025
Hypergraphs as Metro Maps: Drawing Paths with Few Bends in Trees, Cacti, and Plane 4-Graphs
Sabine Cornelsen, Henry Förster, Siddharth Gupta +2
A hypergraph consists of a set of vertices and a set of subsets of vertices, called hyperedges. In the metro map metaphor, each hyperedge is represented by a path (the metro line)…
math.CO2025
Closed Neighborhood Balanced k-Coloring of Graphs
Maurice Almeida, Ravindra Pawar, Siddharth Gupta +1
For a simple graph G = (V, E) and a positive integer k greater than or equal to 2, a coloring of vertices of G using exactly k colors such that every vertex has an equal number of…
math.CO2025
Neighborhood Balanced k-Coloring of Graphs
Maurice Genevieva Almeida, Tarkeshwar Singh, Siddharth Gupta +1
For a simple graph G = (V, E) and a positive integer k greater than or equal to 2, a coloring of vertices of G using exactly k colors such that each vertex has an equal number of n…