Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank (Q2636822): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:23, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank |
scientific article |
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
