On the structure of strong 3-quasi-transitive digraphs

dc.contributor.author	Goldfeder, IA
dc.contributor.author	Urrutia, I
dc.contributor.author	Galeana-Sánchez, H
dc.date.accessioned	2011-01-21T10:35:24Z
dc.date.available	2011-01-21T10:35:24Z
dc.date.issued	2010
dc.identifier.issn	0012-365X
dc.identifier.uri	http://hdlhandlenet/123456789/224
dc.description.abstract	In this paper, D = (V (D), A(D)) denotes a loopless directed graph (digraph) with at most one arc from u to v for every pair of vertices u and v of V (D). Given a digraph D, we say that D is 3-quasi-transitive if, whenever u -> v -> w -> z in D, then u and z are adjacent or u = z. In Bang-Jensen (2004)[3], Bang-Jensen introduced 3-quasi-transitive digraphs and claimed that the only strong 3-quasi-transitive digraphs are the strong semicomplete digraphs and strong semicomplete bipartite digraphs. In this paper, we exhibit a family of strong 3-quasi-transitive digraphs distinct from strong semicomplete digraphs and strong semicomplete bipartite digraphs and provide a complete characterization of strong 3-quasi-transitive digraphs. (C) 2010 Elsevier B.V. All rights reserved.	en_US
dc.language.iso	en	en_US
dc.title	On the structure of strong 3-quasi-transitive digraphs	en_US
dc.type	Article	en_US
dc.identifier.idprometeo	127
dc.identifier.doi	10.1016/j.disc.2010.06.008
dc.source.novolpages	310(19):2495-2498
dc.subject.wos	Mathematics
dc.description.index	WoS: SCI, SSCI o AHCI
dc.subject.keywords	3-quasi-transitive digraphs
dc.subject.keywords	Arc-locally semicomplete digraphs
dc.subject.keywords	Generalization of tournaments
dc.subject.keywords	Hamiltonian digraphs
dc.relation.journal	Discrete Mathematics