Estimates for the length of longest cycles and paths in graphs based on degree sums and neighborhood intersections:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
1992
|
| Schlagworte: | |
| Beschreibung: | 100 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV009877969 | ||
| 003 | DE-604 | ||
| 005 | 19950116 | ||
| 007 | t | ||
| 008 | 941104s1992 m||| 00||| engod | ||
| 035 | |a (OCoLC)64509347 | ||
| 035 | |a (DE-599)BVBBV009877969 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91 |a DE-29T |a DE-83 |a DE-11 |a DE-188 | ||
| 084 | |a MAT 055d |2 stub | ||
| 100 | 1 | |a Wei, Bing |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Estimates for the length of longest cycles and paths in graphs based on degree sums and neighborhood intersections |c vorgelegt von Wei Bing |
| 264 | 1 | |c 1992 | |
| 300 | |a 100 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |a Berlin, Techn. Univ., Diss., 1992 | ||
| 650 | 0 | 7 | |a Abstand |0 (DE-588)4228463-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 0 | 1 | |a Abstand |0 (DE-588)4228463-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006542641 | ||
Datensatz im Suchindex
| _version_ | 1804124238503739392 |
|---|---|
| any_adam_object | |
| author | Wei, Bing |
| author_facet | Wei, Bing |
| author_role | aut |
| author_sort | Wei, Bing |
| author_variant | b w bw |
| building | Verbundindex |
| bvnumber | BV009877969 |
| classification_tum | MAT 055d |
| ctrlnum | (OCoLC)64509347 (DE-599)BVBBV009877969 |
| discipline | Mathematik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01102nam a2200337 c 4500</leader><controlfield tag="001">BV009877969</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19950116 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">941104s1992 m||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)64509347</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009877969</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 055d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wei, Bing</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Estimates for the length of longest cycles and paths in graphs based on degree sums and neighborhood intersections</subfield><subfield code="c">vorgelegt von Wei Bing</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">100 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Berlin, Techn. Univ., Diss., 1992</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Abstand</subfield><subfield code="0">(DE-588)4228463-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Abstand</subfield><subfield code="0">(DE-588)4228463-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006542641</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV009877969 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:42:29Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006542641 |
| oclc_num | 64509347 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM DE-29T DE-83 DE-11 DE-188 |
| owner_facet | DE-91 DE-BY-TUM DE-29T DE-83 DE-11 DE-188 |
| physical | 100 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| spelling | Wei, Bing Verfasser aut Estimates for the length of longest cycles and paths in graphs based on degree sums and neighborhood intersections vorgelegt von Wei Bing 1992 100 S. txt rdacontent n rdamedia nc rdacarrier Berlin, Techn. Univ., Diss., 1992 Abstand (DE-588)4228463-6 gnd rswk-swf Graph (DE-588)4021842-9 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Graph (DE-588)4021842-9 s Abstand (DE-588)4228463-6 s DE-604 |
| spellingShingle | Wei, Bing Estimates for the length of longest cycles and paths in graphs based on degree sums and neighborhood intersections Abstand (DE-588)4228463-6 gnd Graph (DE-588)4021842-9 gnd |
| subject_GND | (DE-588)4228463-6 (DE-588)4021842-9 (DE-588)4113937-9 |
| title | Estimates for the length of longest cycles and paths in graphs based on degree sums and neighborhood intersections |
| title_auth | Estimates for the length of longest cycles and paths in graphs based on degree sums and neighborhood intersections |
| title_exact_search | Estimates for the length of longest cycles and paths in graphs based on degree sums and neighborhood intersections |
| title_full | Estimates for the length of longest cycles and paths in graphs based on degree sums and neighborhood intersections vorgelegt von Wei Bing |
| title_fullStr | Estimates for the length of longest cycles and paths in graphs based on degree sums and neighborhood intersections vorgelegt von Wei Bing |
| title_full_unstemmed | Estimates for the length of longest cycles and paths in graphs based on degree sums and neighborhood intersections vorgelegt von Wei Bing |
| title_short | Estimates for the length of longest cycles and paths in graphs based on degree sums and neighborhood intersections |
| title_sort | estimates for the length of longest cycles and paths in graphs based on degree sums and neighborhood intersections |
| topic | Abstand (DE-588)4228463-6 gnd Graph (DE-588)4021842-9 gnd |
| topic_facet | Abstand Graph Hochschulschrift |
| work_keys_str_mv | AT weibing estimatesforthelengthoflongestcyclesandpathsingraphsbasedondegreesumsandneighborhoodintersections |