Underlying Graphs of 3-Quasi-Transitive Digraphs and 3-Transitive Digraphs
Ruixia Wang ; Shiying Wang
Discussiones Mathematicae Graph Theory, Tome 33 (2013), p. 429-435 / Harvested from The Polish Digital Mathematics Library
Access to full text
Full (PDF)

A digraph is 3-quasi-transitive (resp. 3-transitive), if for any path x0x1 x2x3 of length 3, x0 and x3 are adjacent (resp. x0 dominates x3). C´esar Hern´andez-Cruz conjectured that if D is a 3-quasi-transitive digraph, then the underlying graph of D, UG(D), admits a 3-transitive orientation. In this paper, we shall prove that the conjecture is true.

Publié le : 2013-01-01
EUDML-ID : urn:eudml:doc:267988 
@article{bwmeta1.element.doi-10_7151_dmgt_1680,
     author = {Ruixia Wang and Shiying Wang},
     title = {Underlying Graphs of 3-Quasi-Transitive Digraphs and 3-Transitive Digraphs},
     journal = {Discussiones Mathematicae Graph Theory},
     volume = {33},
     year = {2013},
     pages = {429-435},
     zbl = {1293.05141},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_7151_dmgt_1680}
}

Ruixia Wang; Shiying Wang. Underlying Graphs of 3-Quasi-Transitive Digraphs and 3-Transitive Digraphs. Discussiones Mathematicae Graph Theory, Tome 33 (2013) pp. 429-435. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_7151_dmgt_1680/

[1] J. Bang-Jensen, Kings in quasi-transitive digraphs, Discrete Math. 185 (1998) 19-27. doi:10.1016/S0012-365X(97)00179-9[Crossref]

[2] J. Bang-Jensen and G. Gutin, Digraphs: Theory, Algorithms and Applications (Springer, London, 2000). | Zbl 0958.05002

[3] C. Hernández-Cruz, 3-transitive digraphs, Discuss. Math. Graph Theory 32 (2012) 205-219. doi:10.7151/dmgt.1613[Crossref]

[4] A. Ghouila-Houri, Caractérization des graphes non orient´es dont onpeut orienter les arrˆetes de mani`ere `aobtenir le graphe dune relation dordre, Comptes Rendus de l’Acad´emie des Sciences Paris 254 (1962) 1370-1371.

[5] H. Galeana-Sánchez, I.A. Goldfeder and I. Urrutia, On the structure of strong 3- quasi-transitive digraphs, Discrete Math. 310 (2010) 2495-2498. doi:10.1016/j.disc.2010.06.008[WoS][Crossref] | Zbl 1213.05112

[6] H. Galeana-Sánchez and C. Hernández-Cruz, k-kernels in k-transitive and k-quasitransitive digraphs, Discrete Math. 312 (2012) 2522-2530. doi:10.1016/j.disc.2012.05.005[WoS][Crossref]

[7] S.Wang and R.Wang, Independent sets and non-augmentable paths in arc-locally insemicomplete digraphs and quasi-arc-transitive digraphs, Discrete Math. 311 (2011) 282-288. doi:10.1016/j.disc.2010.11.009[WoS][Crossref] | Zbl 1222.05090