Page not found
This question was removed from MathOverflow for reasons of moderation. Please refer to the help center for possible explanations why a question might be removed.
Here are some similar questions that might be relevant:
- Intersection graphs for "conflicting" directed paths in trees
- Regular graphs whose neighbourhoods induce matchings
- Regular graphs with strongly regular edge colorings
- Expansion in strongly regular graphs
- Spectra of undirected $d$-regular graphs
- Vertex cover of regular graph
- What is known about the non-existence of strongly regular graphs srg(n,k,0,2)?
- Maximum number of leaf blocks in 3-regular (cubic) graph
Try a Google Search
Try searching for similar questions
Browse our recent questions
Browse our popular tags
If you feel something is missing that should be here, contact us.