Szczegóły publikacji
Opis bibliograficzny
On some third parts of nearly complete digraphs / Mariusz MESZKA, Zdzisław SKUPIEŃ // Discrete Mathematics ; ISSN 0012-365X. — 2000 — vol. 212 no. 1–2, s. 129–139. — Bibliogr. s. 139, Abstr. — Publikacja dostępna online od: 2000-01-28. — International Colloquium on Graph Theory : Dornfeld, Germany, April 08-11, 1997
Autorzy (2)
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 1610 |
|---|---|
| Data dodania do BaDAP | 2001-04-18 |
| Tekst źródłowy | URL |
| DOI | 10.1016/S0012-365X(99)00214-9 |
| Rok publikacji | 2000 |
| Typ publikacji | referat w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Discrete Mathematics |
Abstract
For the complete digraph DKn with n greater than or equal to 3, its half as well as its third (or near-third) part, both non-self-converse, are exhibited. A backtracking method for generating a tth part of a digraph is sketched. It is proved that some self-converse digraphs are not among the near-third parts of the complete digraph DK5 in four of the six possible cases. For n = 9 + 6k, k = 0, 1, ..., a third part D of DKn is found such that D is a self-converse oriented graph and all D-decompositions of DKn have trivial automorphism group. (C) 2000 Elsevier Science B.V. All rights reserved.
