Quasi‐transitive digraphs (Q4852401): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Edge-disjoint in- and out-branchings in tournaments and related path problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Kings in quasi-transitive digraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On \(k\)-strong and \(k\)-cyclic digraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3328583 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the structure of local tournaments / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hamiltonian-connected tournaments / rank | |||
Normal rank | |||
Latest revision as of 17:58, 23 May 2024
scientific article; zbMATH DE number 811250
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Quasi‐transitive digraphs |
scientific article; zbMATH DE number 811250 |
Statements
Quasi‐transitive digraphs (English)
0 references
8 February 1996
0 references
pancyclicity
0 references
digraph
0 references
tournaments
0 references
characterizations
0 references
quasi-transitive digraphs
0 references
hamiltonian cycle
0 references
path
0 references
polynomial algorithms
0 references
