Lesson plan

circular-arc graph

In graph theory, a circular-arc graph is the intersection graph of a set of arcs on the circle. It has one vertex for each arc in the set, and an edge between every pair of vertices corresponding to arcs that intersect. Formally, let : I_1, I_2, \ldots, I_n \subset C_1 be a set of arcs. Then the corresponding circular-arc graph is G = (V, E) where : V = \{I_1, I_2, \ldots, I_n\} and : \{I_\alpha, I_\beta\} \in E \iff I_\alpha \cap I_\beta \neq \varnothing. A family of arcs that corresponds to G is called an arc model.

Back to article

Article summary

In graph theory, a circular-arc graph is the intersection graph of a set of arcs on the circle. It has one vertex for each arc in the set, and an edge between every pair of vertices corresponding to arcs that intersect. Formally, let : I_1, I_2, \ldots, I_n \subset C_1 be a set of arcs. Then the corresponding circular-arc graph is G = (V, E) where : V = \{I_1, I_2, \ldots, I_n\} and : \{I_\alpha, I_\beta\} \in E \iff I_\alpha \cap I_\beta \neq \varnothing. A family of arcs that corresponds to G is called an arc model.

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.