On Finding Lekkerkerker-Boland Subgraphs
Discrete Mathematics
2013-03-11 v1 Data Structures and Algorithms
Combinatorics
Abstract
Lekkerkerker and Boland characterized the minimal forbidden induced subgraphs for the class of interval graphs. We give a linear-time algorithm to find one in any graph that is not an interval graph. Tucker characterized the minimal forbidden submatrices of matrices that do not have the consecutive-ones property. We give a linear-time algorithm to find one in any matrix that does not have the consecutive-ones property.
Keywords
Cite
@article{arxiv.1303.1840,
title = {On Finding Lekkerkerker-Boland Subgraphs},
author = {Nathan Lindzey and Ross McConnell},
journal= {arXiv preprint arXiv:1303.1840},
year = {2013}
}
Comments
Submitted to WG 2013