Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\) (Q2146735): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:51, 2 February 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
