Underlying Graphs of 3-Quasi-Transitive Digraphs and 3-Transitive Digraphs
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...
Main Authors: | Wang Ruixia, Wang Shiying |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2013-05-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1680 |
Similar Items
-
4-Transitive Digraphs I: The Structure of Strong 4-Transitive Digraphs
by: Hernández-Cruz César
Published: (2013-05-01) -
Some Remarks On The Structure Of Strong K-Transitive Digraphs
by: Hernández-Cruz César, et al.
Published: (2014-11-01) -
Hamiltonian Cycle Problem in Strong k-Quasi-Transitive Digraphs With Large Diameter
by: Wang Ruixia
Published: (2021-05-01) -
(K − 1)-Kernels In Strong K-Transitive Digraphs
by: Wang Ruixia
Published: (2015-05-01) -
On chordal digraphs and semi-strict chordal digraphs
by: Ye, Ying Ying
Published: (2019)