Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles (Q2689639)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7662538
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles |
scientific article; zbMATH DE number 7662538 |
Statements
Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles (English)
0 references
13 March 2023
0 references
digraphs
0 references
bipartite graphs
0 references
partitions
0 references
directed cycles
0 references
degenerated directed cycles
0 references
degree sum
0 references
0 references
0 references
0 references
0.8609654903411865
0 references
0.8459792137145996
0 references
0.8415602445602417
0 references
0.8245087265968323
0 references
