*001336442
*00520250613140740.0
*007ta
*008101022s1996    no            000 u eng
*00901166cam a2200289 c 4500
*019  $bl
*035  $a(EXLNZ-47BIBSYS_NETWORK)999612040104702201
*035  $a(NO-LaBS)14803538(bibid)
*035  $a(NO-TrBIB)96120401x
*035  $a96120401x-47bibsys_network
*040  $aNO-OsNB$bnob$ekatreg
*080  $a519.17
*1001 $aBlair, Jean$0(NO-TrBIB)90914119$_23402700
*24510$aMaking an arbitrary filled graph minimal by removing fill edges$cJean Blair, Pinar Heggernes, Jan Arne Telle
*260  $aBergen$bDepartment of Informatics, University of Bergen$c1996
*300  $a12 bl.$bfig.
*4901 $aReports in informatics$vreport no. 115
*533  $aElektronisk reproduksjon$b[Norge]$cNasjonalbiblioteket Digital$d2017-05-16
*588  $aKatalogisert etter omslag
*650 7$aGrafteori$2tekord$_186973800
*653  $aGrafteori$_24483200
*7001 $aHeggernes, Pinar$0(NO-TrBIB)90594495$_49330600
*7001 $aTelle, Jan Arne$0(NO-TrBIB)90856584$_31391300
*830 0$aReports in informatics (trykt utg.)$x0333-3590$vreport no. 115$w998711258704702201$_14253500
*85641$3Fulltekst$uhttps://urn.nb.no/URN:NBN:no-nb_digibok_2017041948004$yNettbiblioteket$zDigital representasjon
*901  $a80
*999  $aoai:nb.bibsys.no:999612040104702202$b2021-11-14T20:12:22Z$z999612040104702202
^