New characterizations of proper interval bigraphs (Q896097)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: New characterizations of proper interval bigraphs |
scientific article; zbMATH DE number 6520415
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New characterizations of proper interval bigraphs |
scientific article; zbMATH DE number 6520415 |
Statements
New characterizations of proper interval bigraphs (English)
0 references
11 December 2015
0 references
An interval bigraph is a bipartite graph that can be obtained by assigning an interval to each vertex in such a way that vertices that do not belong to the same partite set are adjacent if and only if the corresponding intervals intersect. Such a graph is called proper if the intervals can also be chosen in such a way that none of them is completely contained in another. This paper provides three new characterisations of proper interval bigraphs: as bipartite graphs avoiding so-called ``astral'' triples of edges, in terms of the concept of dominating pairs, and by means of the biadjacency matrix.
0 references
proper interval bigraph
0 references
astral triple of edges
0 references
monotone consecutive arrangement
0 references
zero partitionable
0 references
circularly compatible 1's
0 references
dominating pair of vertices
0 references
0 references
0.8914981484413147
0 references
0.8592557311058044
0 references
0.852135419845581
0 references
0.8353970646858215
0 references
