Bigraphs/digraphs of Ferrers dimension 2 and asteroidal triple of edges

Autor:	Malay K. Sen, Ashok Kr. Das
Rok vydání:	2005
Předmět:	Combinatorics Vertex (graph theory) Discrete mathematics Computer Science::Hardware Architecture Converse Bigraph Discrete Mathematics and Combinatorics Directed graph Graph Theoretical Computer Science Separable space Mathematics
Zdroj:	Discrete Mathematics. 295:191-195
ISSN:	0012-365X
DOI:	10.1016/j.disc.2004.11.012
Popis:	Three mutually separable edges of a graph form an asteroidal triple of edges (ATE), if for any two of them, there is a path from the vertex set of one to the vertex set of another that avoids the neighbours of the third edge. In this note, it is shown that a bigraph of Ferrers dimension at most 2 is bichordal and ATE-free, but the converse is not true.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7aeff4c2d57abe95a6384cdfc697dcf2 https://doi.org/10.1016/j.disc.2004.11.012 Zobrazit plný text záznamu Full Text from ScienceDirect