On some third parts of nearly complete digraphs (Q1970585): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q186111 |
||
Property / reviewed by | |||
Property / reviewed by: Matúš Harminc / rank | |||
Revision as of 20:19, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On some third parts of nearly complete digraphs |
scientific article |
Statements
On some third parts of nearly complete digraphs (English)
0 references
13 July 2000
0 references
The authors proceed with their investigation of third and near-third parts of complete digraphs [see Combinatorica 18, No.~3, 413-424 (1998; Zbl 0924.05052)]. Neat new results concerning mainly the complete digraphs with \(5\) and with \(9+6k\), \(k\in\{0,1,\dots \}\) vertices are presented. Also an outline of an algorithm to find the \(t\)th parts of a digraph is included. Parts are asked to be self-converse or to have (or not to have) a couple of symmetric arcs. The backtracking method is applied.
0 references
line decomposition
0 references
digraph
0 references
graph
0 references
multigraph
0 references
isomorphic parts
0 references