Graphs \(G\) where \(G-N[v]\) is a tree for each vertex \(v\)
From MaRDI portal
Publication:6581900
DOI10.1007/S00373-024-02814-4zbMATH Open1546.05054MaRDI QIDQ6581900
Publication date: 1 August 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs
- Terwilliger graphs in which the neighborhood of some vertex is isomorphic to a Petersen graph
- On graphs in which the neighborhood of each vertex is isomorphic to the Higman-Sims graph
- Graphs whose neighborhoods have no special cycles
- On graphs in which the neighborhood of each vertex is isomorphic to the Gewirtz graph
- On graphs with a constant link. II
- A note on graphs whose neighborhoods are n-cycles
- Graphs in which \(G - N[v]\) is a cycle for each vertex \(v\)
- Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\)
- Isolation of cycles
- Isolation of \(k\)-cliques
- Partial domination of maximal outerplanar graphs
- Isolation number of maximal outerplanar graphs
- The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph
- Graphs with given neighborhoods of vertices
- On extremal sizes of locally k-tree graphs
- Partial domination - the isolation number of a graph
- Path-neigborhood graphs
This page was built for publication: Graphs \(G\) where \(G-N[v]\) is a tree for each vertex \(v\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6581900)
