Colorings of circle graphs may also be used to find book embeddings of arbitrary graphs : if the vertices of a given graph " G " are arranged on a circle, with the edges of " G " forming chords of the circle, then the intersection graph of these chords is a circle graph and colorings of this circle graph are equivalent to book embeddings that respect the given circular layout.
22.
Colorings of circle graphs may also be used to find book embeddings of arbitrary graphs : if the vertices of a given graph " G " are arranged on a circle, with the edges of " G " forming chords of the circle, then the intersection graph of these chords is a circle graph and colorings of this circle graph are equivalent to book embeddings that respect the given circular layout.
23.
Colorings of circle graphs may also be used to find book embeddings of arbitrary graphs : if the vertices of a given graph " G " are arranged on a circle, with the edges of " G " forming chords of the circle, then the intersection graph of these chords is a circle graph and colorings of this circle graph are equivalent to book embeddings that respect the given circular layout.
