EEMCS EPrints Service
|
||||||||||||||||
2011
Bonsma, P.S. and Broersma, H.J. and Patel, V. and Pyatkin, A.
(2011)
The complexity status of problems related to sparsest cuts.
In: Proceedings of the 21st International Workshop on Combinatorial Algorithms, IWOCA 2010, 26-28 July 2010, London, UK.
pp. 125-135.
Lecture Notes in Computer Science 6460.
Springer Verlag.
ISSN 0302-9743
ISBN 978-3-642-19221-0
Li, MingChu and Chen, Xiaodong and Broersma, H.J.
(2011)
Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs.
Journal of graph theory, 68 (4).
pp. 285-298.
ISSN 0364-9024
*** ISI Impact 0,561 ***
|
||||||||||||||||