The following pages link to Nicole Eggemann (Q412350):
Displayed 6 items.
- The complexity of two graph orientation problems (Q412352) (← links)
- (Q548266) (redirect page) (← links)
- The clustering coefficient of a scale-free random graph (Q548267) (← links)
- \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) (Q602756) (← links)
- Minimizing the Oriented Diameter of a Planar Graph (Q2851475) (← links)
- Non-searchability of random scale-free graphs (Q5401475) (← links)