3 papers
math.CO2025
A polynomial algorithm to compute the boxicity and threshold dimension of complements of block graphs
Marco Caoduro, Will Evans, Tao Gaede
The boxicity of a graph is the minimum dimension that admits a representation of as the intersection graph of a family of axis-parallel boxes in . Computi…
math.CO2025
A characterization of unimodular hypergraphs with disjoint hyperedges
Marco Caoduro, Meike Neuwohner, Joseph Paat
The incidence matrix of a graph is totally unimodular if and only if the graph is bipartite, i.e., it contains no odd cycles. We extend the characterization of total unimodularity…
math.CO2025
On the Boxicity of Line Graphs and of Their Complements
Marco Caoduro, András SebÅ
The boxicity of a graph is the smallest dimension allowing a representation of it as the intersection graph of a set of -dimensional axis-parallel boxes. We present a simple…