Results 21 to 30 of about 333,465 (75)
Characterisations of Intersection Graphs by Vertex Orderings [PDF]
Australasian J. Combinatorics 34:261-268, 2006, 2004 Characterisations of interval graphs, comparability graphs, co-comparability graphs, permutation graphs, and split graphs in terms of linear orderings of the vertex set are presented. As an application, it is proved that interval graphs, co-comparability graphs, AT-free graphs, and split graphs have bandwidth bounded by their maximum degree.
arxiv
Graph limits and hereditary properties [PDF]
arXiv, 2011 We collect some general results on graph limits associated to hereditary classes of graphs. As examples, we consider some classes defined by forbidden subgraphs and some classes of intersection graphs, including triangle-free graphs, chordal graphs, cographs, interval graphs, unit interval graphs, threshold graphs, and line graphs.
arxiv
Extending Partial Representations of Interval Graphs [PDF]
arXiv, 2013 Interval graphs are intersection graphs of closed intervals of the real-line. The well-known computational problem, called recognition, asks whether an input graph $G$ can be represented by closed intervals, i.e., whether $G$ is an interval graph. There are several linear-time algorithms known for recognizing interval graphs, the oldest one is by Booth
arxiv
A new haplotype block detection method for dense genome sequencing data based on interval graph modeling of clusters of highly correlated SNPs. [PDF]
Bioinformatics, 2018 Kim SA, Cho CS, Kim SR, Bull SB, Yoo YJ.
europepmc +1 more source
Interval H-graphs : Recognition and forbidden obstructions [PDF]
arXivWe introduce the class of interval $H$-graphs, which is the generalization of interval graphs, particularly interval bigraphs. For a fixed graph $H$ with vertices $a_1,a_2,\dots,a_k$, we say that an input graph $G$ with given partition $V_1,\dots,V_k$ of its vertices is an interval $H$-graph if each vertex $v \in G$ can be represented by an interval ...
arxiv
Online coloring of short interval graphs and two-count interval graphs [PDF]
arXivWe study the online coloring of $\sigma$-interval graphs which are interval graphs where the interval lengths are between 1 and $\sigma$ and 2-count interval graphs which are interval graphs that require at most $2$ distinct interval lengths. For online $\sigma$-interval graph coloring, we focus on online algorithms that do not have knowledge of the ...
arxiv
Vertex orders in higher dimensions [PDF]
arXivUnit interval and interval complexes are higher-dimensional generalizations of unit interval and interval graphs, respectively. We show that strongly connected unit interval complexes are shellable with shellings induced by their unit interval orders. We also show that these complexes are vertex decomposable and hence shelling completable. On the other
arxiv
Single-cell 3D genome reconstruction in the haploid setting using rigidity theory. [PDF]
J Math BiolDewar S +4 more
europepmc +1 more source
Edge-level multi-constraint graph pattern matching with lung cancer knowledge graph. [PDF]
Front Big DataTu H, Li L, Tao Z, Zhang Z.
europepmc +1 more source