The arc-width of a graph (Q5949342)

An arc-represention of a graph \(G\) maps the vertices of \(G\) to arcs of a circle such that adjacent vertices are mapped to intersecting arcs. The arc-width of a representation is the maximum number of arcs containing a given point \(P\). The arc-width of a graph \(G\), \(\text{aw}(G)\), is the minimal arc-width over all of its arc-representations. NEWLINENEWLINENEWLINEThis parameter is closely related to interval representations of a graph, where the corresponding parameter is called the interval-width of a graph. It is also related to the more common path-width of a graph, and the vortex-width of a graph. In this paper, the authors relate these parameters, including a proof that \(\text{aw}(K_{s,s}) = s\). They also ask a number of interesting questions about these parameters.