Path-neighborhood graphs
From MaRDI portal
Recommendations
Cited in
(8)- 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\)
- ℱ-WORM colorings of some 2-trees: partition vectors
- scientific article; zbMATH DE number 5031580 (Why is no real title available?)
- Graphs \(G\) where \(G-N[v]\) is a regular graph for each vertex \(v\)
- Graphs \(G\) where \(G-N[v]\) is a tree for each vertex \(v\)
- Some locally Kneser graphs
- On realizability of some graphs
This page was built for publication: Path-neighborhood graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495054)