Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\) (Q2146735)

From MaRDI portal
Revision as of 20:02, 4 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q113877210, #quickstatements; #temporary_batch_1712201099914)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    21 June 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    star
    0 references
    path
    0 references
    induced matching
    0 references
    clique
    0 references
    Trahtenbrot-Zykov problem
    0 references
    0 references
    0 references