Add to ORKGGraph Theory is a field concerned with abstract representations of data and data interactions. We study several classes of graphs and prove ways of representing such graphs as geometric shapes, namely k-dimensional axis-parallel boxes. This type of representation (called boxicity) is a notion that finds uses in social networks, ecology and operations research.https://ecommons.udayton.edu/stander_posters/1292/thumbnail.jp
AbstractThe boxicity of a graph H, denoted by box(H), is the minimum integer k such that H is an int...
We show that every graph of maximum degree 3 can be represented as the intersection graph of axis pa...
The boxicity of a graph H, denoted by box(H), is the minimum integer k such that H is an intersectio...
An axis-parallel b-dimensional box is a Cartesian product R1 x R2 X... x Rb where Ri (for 1 <= i <= ...
AbstractAn axis-parallel b-dimensional box is a Cartesian product R1×R2×⋯×Rb where Ri (for 1⩽i⩽b) is...
An axis-parallel b-dimensional box is a Cartesian product R1 x R2 X... x Rb where Ri (for 1 <= i <= ...
AbstractA graph has boxicity k if k is the smallest integer such that G is an intersection graph of ...
An axis-parallel b-dimensional box is a Cartesian product R1×-2×...×Rb where Ri is a closed interval...
An axis-parallel b-dimensional box is a Cartesian product R-1 x R-2 x ... x R-b where R-i is a close...
An axis-parallel b-dimensional box is a Cartesian product R-1 x R-2 x ... x R-b where R-i is a close...
A graph Gis said to be an intersection graph of sets from a family of sets if there exists a func...
AbstractThe boxicity of a graph H, denoted by box(H), is the minimum integer k such that H is an int...
AbstractThe intersection graph of a family M of sets has the sets in M as vertices and an edge betwe...
The boxicity of a graph G, denoted as box(G), is the minimum dimension d for which each vertex of G ...
AbstractA graph has boxicity k if k is the smallest integer such that G is an intersection graph of ...
AbstractThe boxicity of a graph H, denoted by box(H), is the minimum integer k such that H is an int...
We show that every graph of maximum degree 3 can be represented as the intersection graph of axis pa...
The boxicity of a graph H, denoted by box(H), is the minimum integer k such that H is an intersectio...
An axis-parallel b-dimensional box is a Cartesian product R1 x R2 X... x Rb where Ri (for 1 <= i <= ...
AbstractAn axis-parallel b-dimensional box is a Cartesian product R1×R2×⋯×Rb where Ri (for 1⩽i⩽b) is...
An axis-parallel b-dimensional box is a Cartesian product R1 x R2 X... x Rb where Ri (for 1 <= i <= ...
AbstractA graph has boxicity k if k is the smallest integer such that G is an intersection graph of ...
An axis-parallel b-dimensional box is a Cartesian product R1×-2×...×Rb where Ri is a closed interval...
An axis-parallel b-dimensional box is a Cartesian product R-1 x R-2 x ... x R-b where R-i is a close...
An axis-parallel b-dimensional box is a Cartesian product R-1 x R-2 x ... x R-b where R-i is a close...
A graph Gis said to be an intersection graph of sets from a family of sets if there exists a func...
AbstractThe boxicity of a graph H, denoted by box(H), is the minimum integer k such that H is an int...
AbstractThe intersection graph of a family M of sets has the sets in M as vertices and an edge betwe...
The boxicity of a graph G, denoted as box(G), is the minimum dimension d for which each vertex of G ...
AbstractA graph has boxicity k if k is the smallest integer such that G is an intersection graph of ...
AbstractThe boxicity of a graph H, denoted by box(H), is the minimum integer k such that H is an int...
We show that every graph of maximum degree 3 can be represented as the intersection graph of axis pa...
The boxicity of a graph H, denoted by box(H), is the minimum integer k such that H is an intersectio...