Solution of Vizing's problem on interchanges for the case of graphs with maximum degree 4 and related results (Q3188669)
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 6614346
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solution of Vizing's problem on interchanges for the case of graphs with maximum degree 4 and related results |
scientific article; zbMATH DE number 6614346 |
Statements
Solution of Vizing's Problem on Interchanges for the case of Graphs with Maximum Degree 4 and Related Results (English)
0 references
12 August 2016
0 references
\(t\)-edge coloring
0 references
4-edge coloring
0 references
class 1 graph
0 references
0.823388934135437
0 references
0.8028913140296936
0 references
0.7853502631187439
0 references
0.7836430072784424
0 references
0.7836430072784424
0 references
