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

    Browse by Journal and Volume

    Up a level
    Export as [feed] Atom [feed] RSS
    Group by: Author(s) | Date | School | No Grouping
    Jump to: E
    Number of items: 1.

    E

    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.

    This list was generated on Thu Nov 21 04:00:39 2024 GMT.