Characterization of \((m,1)\)-transitive and \((3,2)\)-transitive semi- complete directed graphs

DOI10.1016/0012-365X(94)00060-VzbMath0818.05050MaRDI QIDQ1343273

Zsolt Tuza

Publication date: 1 February 1995

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

zbMATH Keywords

algorithmdirected graphdirected path\((m,k)\)-transitivity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs

Cites Work

• Unnamed Item
• On a generalization of transitivity for digraphs
• On a property of the class of n-colorable graphs
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Characterization of \((m,1)\)-transitive and \((3,2)\)-transitive semi- complete directed graphs