pith. sign in

arxiv: 1404.5468 · v1 · pith:U74GYLIHnew · submitted 2014-04-22 · 💻 cs.DM

Intersection Graphs: An Introduction

classification 💻 cs.DM
keywords graphsintersectionarticleimportantintroductionalgorithmicapplicationbasic
0
0 comments X
read the original abstract

Intersection graphs are very important in both theoretical as well as application point of view. Depending on the geometrical representation, different type of intersection graphs are defined. Among them interval, circular-arc, permutation, trapezoid, chordal, disk, circle graphs are more important. In this article, a brief introduction of each of these intersection graphs is given. Some basic properties and algorithmic status of few problems on these graphs are cited. This article will help to the beginners to start work in this direction. Since the article contains a lot of information in a compact form it is also useful for the expert researchers too.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.