Path-connectivity in local tournaments
From MaRDI portal
Publication:1356475
DOI10.1016/S0012-365X(96)00240-3zbMath0878.05039MaRDI QIDQ1356475
Publication date: 5 January 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Path connectivity of line graphs and total graphs of complete bipartite graphs, The structure of strong arc-locally in-semicomplete digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hamiltonian-connected tournaments
- Completely strong path-connected tournaments
- Cycles of each length in tournaments
- On the structure of locally semicomplete digraphs
- On complementary cycles in locally semicomplete digraphs
- A classification of locally semicomplete digraphs
- Spanning local tournaments in locally semicomplete digraphs
- On the structure of local tournaments
- Locally semicomplete digraphs: A generalization of tournaments
- Connectivity properties of locally semicomplete digraphs
- Locally semicomplete digraphs that are complementarym-pancyclic
- Weakly Hamiltonian-connected locally semicomplete digraphs
- Strongly Hamiltonian-connected locally semicomplete digraphs
- Cycles of Each Length in Regular Tournaments