[HTML][HTML] Proper circular arc graphs as intersection graphs of pathson a grid
Discrete Applied Mathematics, 2019•Elsevier
… In this paper we present a characterization, by an infinite family of minimal forbidden
induced subgraphs, of proper circular arc graphs which are intersection graphs of paths on
a grid, where each path has at most one bend (turn). … In this paper, we are interested in a
subclass of circular arc graphs (CA for short), namely proper circular arc graphs. In [1], the
authors showed that CA … We conclude Section 3 by noting that a characterization by a
family of minimal forbidden induced subgraphs of proper circular arc graphs which are B 1 -EPR�…
induced subgraphs, of proper circular arc graphs which are intersection graphs of paths on
a grid, where each path has at most one bend (turn). … In this paper, we are interested in a
subclass of circular arc graphs (CA for short), namely proper circular arc graphs. In [1], the
authors showed that CA … We conclude Section 3 by noting that a characterization by a
family of minimal forbidden induced subgraphs of proper circular arc graphs which are B 1 -EPR�…
Abstract
In this paper we present a characterization, by an infinite family of minimal forbidden induced subgraphs, of proper circular arc graphs which are intersection graphs of paths on a grid, where each path has at most one bend (turn).
Elsevier
Showing the best result for this search. See all results