Independence and matching number in graphs with maximum degree 4 (Q2439118): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1312.0407 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5508779 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Independent sets and matchings in subcubic graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Independence in graphs with maximum degree four / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A bound on the chromatic number of graphs without certain induced subgraphs / rank | |||
Normal rank | |||
Latest revision as of 10:15, 7 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Independence and matching number in graphs with maximum degree 4 |
scientific article |
Statements
Independence and matching number in graphs with maximum degree 4 (English)
0 references
7 March 2014
0 references
independence number
0 references
matching number
0 references
\(\chi\)-binding function
0 references
