Kings in quasi-transitive digraphs

DOI10.1016/S0012-365X(97)00179-9zbMath0955.05048OpenAlexW1971345884MaRDI QIDQ1584249

Jing Huang, Jörgen Bang-Jensen

Publication date: 2 November 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00179-9

zbMATH Keywords

quasi-transitive digraphking

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (11)

On the existence and number of (\(k+1\))-kings in \(k\)-quasi-transitive digraphs ⋮ Quasi‐transitive digraphs ⋮ \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs ⋮ \((k + 1)\)-kernels and the number of \(k\)-kings in \(k\)-quasi-transitive digraphs ⋮ Kings in locally semicomplete digraphs ⋮ Chordality of locally semicomplete and weakly quasi-transitive digraphs ⋮ Kernels in quasi-transitive digraphs ⋮ Weakly Hamiltonian-connected ordinary multipartite tournaments ⋮ Linkages in locally semicomplete digraphs and quasi-transitive digraphs ⋮ Quasi-Transitive Digraphs and Their Extensions ⋮ k‐Kings in k‐Quasitransitive Digraphs

Cites Work

• The radii of n-partite tournaments
• Every vertex a king
• Kings in \(k\)-partite tournaments
• Vertex heaviest paths and cycles in quasi-transitive digraphs
• Toppling kings in a tournament by introducing new kings
• Quasi‐transitive digraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Kings in quasi-transitive digraphs