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
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2013.09.012 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2013.09.012 / rank | |||
Normal rank | |||
Latest revision as of 12:31, 19 December 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
0 references
