A lower bound on the acyclic matching number of subcubic graphs (Q1637156): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:10, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound on the acyclic matching number of subcubic graphs |
scientific article |
Statements
A lower bound on the acyclic matching number of subcubic graphs (English)
0 references
7 June 2018
0 references
acyclic matching
0 references
subcubic graph
0 references
