A degree condition implying ore-type condition for even \([2,b]\)-factors in graphs (Q2364097)
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: A degree condition implying ore-type condition for even [2,b]-factors in graphs |
scientific article; zbMATH DE number 6747783
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A degree condition implying ore-type condition for even \([2,b]\)-factors in graphs |
scientific article; zbMATH DE number 6747783 |
Statements
A degree condition implying ore-type condition for even \([2,b]\)-factors in graphs (English)
0 references
17 July 2017
0 references
\([a,b]\)-factor
0 references
even factor
0 references
2-edge-connected
0 references
minimum degree
0 references
0.940062403678894
0 references
0.91072016954422
0 references
0.909908652305603
0 references
0.8957905173301697
0 references