A conjecture on 3-anti-quasi-transitive digraphs

DOI10.1016/J.DISC.2013.12.026zbMath1283.05118OpenAlexW2086681794WikidataQ122980675 ScholiaQ122980675MaRDI QIDQ2436832

Ruixia Wang

Publication date: 27 February 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.12.026

zbMATH Keywords

Hamiltonian digraphcycle factortournament-like digraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Critical kernel imperfect problem in generalizations of bipartite tournaments ⋮ Supereulerian 3-path-quasi-transitive digraphs ⋮ Miscellaneous Digraph Classes

Cites Work

• Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs
• On the structure of strong 3-quasi-transitive digraphs
• The structure of strong arc-locally in-semicomplete digraphs
• The structure of strong arc-locally semicomplete digraphs
• Independent sets and non-augmentable paths in generalizations of tournaments
• Kernels and perfectness in arc-local tournament digraphs
• Underlying graphs of 3-quasi-transitive digraphs and 3-transitive digraphs

This page was built for publication: A conjecture on 3-anti-quasi-transitive digraphs