The forcing edge covering number of a graph (Q2892108): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2010729687 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4692391 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The forcing geodetic number of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Forcing matching numbers of fullerene graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the forced matching numbers of bipartite graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The forcing Steiner number of a graph / rank | |||
Normal rank | |||
Latest revision as of 08:17, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The forcing edge covering number of a graph |
scientific article |
Statements
The forcing edge covering number of a graph (English)
0 references
18 June 2012
0 references
edge covering number
0 references
forcing edge covering number
0 references
