Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs

DOI10.1016/j.disc.2010.11.009zbMath1222.05090OpenAlexW2076055134MaRDI QIDQ626767

Ruixia Wang, Shi-ying Wang

Publication date: 18 February 2011

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

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

zbMATH Keywords

digraphsindependent setsarc-locally in-semicomplete digraphsnon-augmentable pathsquasi-arc-transitive digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (9)

Some results on Berge's conjecture and begin-end conjecture ⋮ Extended path partition conjecture for semicomplete and acyclic compositions ⋮ On the existence and number of (\(k+1\))-kings in \(k\)-quasi-transitive digraphs ⋮ A conjecture on 3-anti-quasi-transitive digraphs ⋮ \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs ⋮ Some results on 4-transitive digraphs ⋮ Critical kernel imperfect problem in generalizations of bipartite tournaments ⋮ Quasi-Transitive Digraphs and Their Extensions ⋮ Miscellaneous Digraph Classes

Cites Work

• 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 which meet all longest paths
• Independent sets and non-augmentable paths in generalizations of tournaments
• Digraphs
• Unnamed Item

This page was built for publication: Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs