Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank (Q2636822)
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 6258983
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank |
scientific article; zbMATH DE number 6258983 |
Statements
Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank (English)
0 references
18 February 2014
0 references
rank of graphs
0 references
matching number
0 references
chromatic index
0 references
independence number
0 references
0 references
0.9269248
0 references
0.90877235
0 references
0.9074123
0 references
0.9053619
0 references
0.90284324
0 references
0.9007001
0 references
0 references
0.8975971
0 references
0.8965959
0 references
