Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference20 articles.
1. Neighborhood numbers, new invariants of undirected graphs;Brigham,1986
2. A generalization of Ore's theorem involving neighborhood unions;Broersma;Discrete Math.,1993
3. Hamiltonicity for K1,r-free graphs;Chen;J. Graph Theory,1995
4. Neighborhood union and hamiltonian graphs;Faudree;Ars Combin.,1991
5. On independent generalized degree and independence number in K1,m-free graphs;Faudree;Discrete Math.,1992