scientific article; zbMATH DE number 4031742
From MaRDI portal
Publication:3772256
Recommendations
Cited in
(11)- The neighbour-scattering number can be computed in polynomial time for interval graphs
- Neighbour-connectivity in regular graphs
- The structure of neighbor disconnected vertex transitive graphs
- A graph-theoretic result for a model of neural computation
- When is NEPS of graphs connected?
- scientific article; zbMATH DE number 3849278 (Why is no real title available?)
- scientific article; zbMATH DE number 4049682 (Why is no real title available?)
- scientific article; zbMATH DE number 867625 (Why is no real title available?)
- scientific article; zbMATH DE number 885339 (Why is no real title available?)
- Neighbor set for the existence of (g,f,n)-critical graphs
- On a neighborhood condition implying the existence of disjoint complete graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3772256)