Colour degree matrices of graphs with at most one cycle (Q298973)
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: Colour degree matrices of graphs with at most one cycle |
scientific article; zbMATH DE number 6595957
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Colour degree matrices of graphs with at most one cycle |
scientific article; zbMATH DE number 6595957 |
Statements
Colour degree matrices of graphs with at most one cycle (English)
0 references
21 June 2016
0 references
colour degree matrix
0 references
degree constrained edge-partitioning
0 references
edge packing
0 references
discrete tomography
0 references
edge-disjoint realisations
0 references
0 references
0.7352859377861023
0 references
0.7305094003677368
0 references
0.7261056303977966
0 references
0.7260706424713135
0 references
0.7229869961738586
0 references
