Birkbeck, University of London logo
BIROn - Birkbeck Institutional Research Online

    Browse by Person

    Up a level
    Export as [feed] Atom [feed] RSS
    Group by: Item Type | Date | Journal or Publication Title | No Grouping
    Jump to: Discrete Applied Mathematics | Electronic Notes in Discrete Mathematics
    Number of items: 4.

    Discrete Applied Mathematics

    Eggemann, N. and Noble, Steven (2012) The complexity of two graph orientation problems. Discrete Applied Mathematics 160 (4-5), pp. 513-517. ISSN 0166-218X.

    Eggemann, N. and Noble, Steven (2011) The clustering coefficient of a scale-free random graph. Discrete Applied Mathematics 159 (10), pp. 953-965. ISSN 0166-218X.

    Eggemann, N. and Havet, F. and Noble, Steven (2010) k-L(2,1)-labelling for planar graphs is NP-complete for k≥4. Discrete Applied Mathematics 158 (16), pp. 1777-1788. ISSN 0166-218X.

    Electronic Notes in Discrete Mathematics

    Eggemann, N. and Noble, Steven (2009) Minimizing the Oriented Diameter of a Planar Graph. Electronic Notes in Discrete Mathematics 34 , pp. 267-271. ISSN 1571-0653.

    This list was generated on Tue Nov 26 05:57:35 2024 GMT.