Bibliographic Details
| Title: |
Exactly Hittable Interval Graphs. |
| Authors: |
Nisha, K. K.1, Narayanaswamy, N. S.1, Dhannya, S. M.2 |
| Superior Title: |
Discrete Mathematics & Theoretical Computer Science (DMTCS). 2023 Special Issue, Vol. 25, p1-22. 22p. |
| Subject Terms: |
*HYPERGRAPHS, *MATHEMATICS, *GRAPHIC methods, *ORTHOGONAL functions, *GRAPH theory |
| Abstract: |
Given a set system (also well-known as a hypergraph) H = {U, X}, where U is a set of elements and X is a set of subsets of U, an exact hitting set S is a subset of U such that each subset in X contains exactly one element in S. We refer to a set system as exactly hittable if it has an exact hitting set. In this paper, we study interval graphs which have intersection models that are exactly hittable. We refer to these interval graphs as Exactly Hittable Interval Graphs (EHIG). We present a forbidden structure characterization for EHIG. We also show that the class of proper interval graphs is a strict subclass of EHIG. Finally, we give an algorithm that runs in polynomial time to recognize graphs belonging to the class of EHIG. [ABSTRACT FROM AUTHOR] |
|
Copyright of Discrete Mathematics & Theoretical Computer Science (DMTCS) is the property of Discrete Mathematics & Theoretical Computer Science DMTCS and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Academic Search Premier |