Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\) (Q2146735): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2022.04.023 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2022.04.023 / rank | |||
Normal rank | |||
Latest revision as of 06:03, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\) |
scientific article |
Statements
Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\) (English)
0 references
21 June 2022
0 references
star
0 references
path
0 references
induced matching
0 references
clique
0 references
Trahtenbrot-Zykov problem
0 references
0 references
0 references
