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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2022.04.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4281690451 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q113877210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with given neighborhoods of vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isolation of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isolation of \(k\)-cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial domination of maximal outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extremal sizes of locally k-tree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs whose neighborhoods have no special cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5672654 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with a constant link. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4017167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial domination - the isolation number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on graphs whose neighborhoods are n-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3032295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Terwilliger graphs in which the neighborhood of some vertex is isomorphic to a Petersen graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs in which the neighborhood of each vertex is isomorphic to the Gewirtz graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3872508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs in which the neighborhood of each vertex is isomorphic to the Higman-Sims graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-neigborhood graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3166108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isolation number of maximal outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs in which \(G - N[v]\) is a cycle for each vertex \(v\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5527633 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:42, 29 July 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
    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