Algorithmic study on 2-transitivity of graphs (Q6611052)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithmic study on 2-transitivity of graphs |
scientific article; zbMATH DE number 7919053
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic study on 2-transitivity of graphs |
scientific article; zbMATH DE number 7919053 |
Statements
Algorithmic study on 2-transitivity of graphs (English)
0 references
26 September 2024
0 references
2-transitivity
0 references
NP-completeness
0 references
linear-time algorithm
0 references
chordal graphs
0 references
bipartite graphs
0 references
split graphs
0 references
