Search 205,599,273 papers from all fields of science

Search

Sign InCreate Free Account

Corpus ID: 119154259

Veto Interval Graphs and Variations

@article{Flesch2017VetoIG,
title={Veto Interval Graphs and Variations},
author={Breeann Flesch and Jessica Kawana and Joshua D. Laison and Dana Ariel Lapides and Stephanie Partlow and Gregory J. Puleo},
journal={arXiv: Combinatorics},
year={2017}
}

We introduce a variation of interval graphs, called veto interval (VI) graphs. A VI graph is represented by a set of closed intervals, each containing a point called a veto mark. The edge $ab$ is in the graph if the intervals corresponding to the vertices $a$ and $b$ intersect, and neither contains the veto mark of the other. We find families of graphs which are VI graphs, and prove results towards characterizing the maximum chromatic number of a VI graph. We define and prove similar results… Expand

We prove that the complements of interval bigraphs are precisely those circular arc graphs of clique covering number two, which admit a representation without two arcs covering the whole circle. We… Expand

Intersection digraphs analogous to undirected intersection graphs are introduced, and are characterized in terms of the consecutive ones property of certain matrices, in Terms of the adjacency matrix and interms of Ferrers dig graphs.Expand