• Corpus ID: 119154259

Veto Interval Graphs and Variations

  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},
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… 


Interval bigraphs and circular arc graphs
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
Algorithms for Interval Catch Digraphs
Interval digraphs: An analogue of interval graphs
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.
House of Graphs: A database of interesting graphs
Algorithmic graph theory and perfect graphs
On planarity and colorability of circulant graphs
A characterization of interval catch digraphs
On Probe Interval Graphs
A short proof that 'proper = unit'
Tolerance graphs, volume 89 of Cambridge Studies in Advanced Mathematics
  • 2004