A minimum degree result for disjoint cycles and forests in graphs:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | German |
| Veröffentlicht: |
Hamburg
Math. Seminar, Univ.
1997
|
| Schriftenreihe: | Hamburger Beiträge zur Mathematik
67 |
| Beschreibung: | 14 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011738058 | ||
| 003 | DE-604 | ||
| 005 | 19980507 | ||
| 007 | t | ||
| 008 | 980120s1997 gw |||| 00||| ger d | ||
| 016 | 7 | |a 95231567X |2 DE-101 | |
| 035 | |a (OCoLC)75825338 | ||
| 035 | |a (DE-599)BVBBV011738058 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-12 | ||
| 100 | 1 | |a Schuster, Gerald W. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A minimum degree result for disjoint cycles and forests in graphs |c Gerald W. Schuster |
| 264 | 1 | |a Hamburg |b Math. Seminar, Univ. |c 1997 | |
| 300 | |a 14 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Hamburger Beiträge zur Mathematik |v 67 | |
| 830 | 0 | |a Hamburger Beiträge zur Mathematik |v 67 |w (DE-604)BV011638881 |9 67 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007918498 | ||
Datensatz im Suchindex
| _version_ | 1804126279286390784 |
|---|---|
| any_adam_object | |
| author | Schuster, Gerald W. |
| author_facet | Schuster, Gerald W. |
| author_role | aut |
| author_sort | Schuster, Gerald W. |
| author_variant | g w s gw gws |
| building | Verbundindex |
| bvnumber | BV011738058 |
| ctrlnum | (OCoLC)75825338 (DE-599)BVBBV011738058 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00882nam a2200289 cb4500</leader><controlfield tag="001">BV011738058</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19980507 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">980120s1997 gw |||| 00||| ger d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">95231567X</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)75825338</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011738058</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">ger</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Schuster, Gerald W.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A minimum degree result for disjoint cycles and forests in graphs</subfield><subfield code="c">Gerald W. Schuster</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hamburg</subfield><subfield code="b">Math. Seminar, Univ.</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">14 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="490" ind1="1" ind2=" "><subfield code="a">Hamburger Beiträge zur Mathematik</subfield><subfield code="v">67</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Hamburger Beiträge zur Mathematik</subfield><subfield code="v">67</subfield><subfield code="w">(DE-604)BV011638881</subfield><subfield code="9">67</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007918498</subfield></datafield></record></collection> |
| id | DE-604.BV011738058 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:14:56Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007918498 |
| oclc_num | 75825338 |
| open_access_boolean | |
| owner | DE-12 |
| owner_facet | DE-12 |
| physical | 14 S. |
| publishDate | 1997 |
| publishDateSearch | 1997 |
| publishDateSort | 1997 |
| publisher | Math. Seminar, Univ. |
| record_format | marc |
| series | Hamburger Beiträge zur Mathematik |
| series2 | Hamburger Beiträge zur Mathematik |
| spelling | Schuster, Gerald W. Verfasser aut A minimum degree result for disjoint cycles and forests in graphs Gerald W. Schuster Hamburg Math. Seminar, Univ. 1997 14 S. txt rdacontent n rdamedia nc rdacarrier Hamburger Beiträge zur Mathematik 67 Hamburger Beiträge zur Mathematik 67 (DE-604)BV011638881 67 |
| spellingShingle | Schuster, Gerald W. A minimum degree result for disjoint cycles and forests in graphs Hamburger Beiträge zur Mathematik |
| title | A minimum degree result for disjoint cycles and forests in graphs |
| title_auth | A minimum degree result for disjoint cycles and forests in graphs |
| title_exact_search | A minimum degree result for disjoint cycles and forests in graphs |
| title_full | A minimum degree result for disjoint cycles and forests in graphs Gerald W. Schuster |
| title_fullStr | A minimum degree result for disjoint cycles and forests in graphs Gerald W. Schuster |
| title_full_unstemmed | A minimum degree result for disjoint cycles and forests in graphs Gerald W. Schuster |
| title_short | A minimum degree result for disjoint cycles and forests in graphs |
| title_sort | a minimum degree result for disjoint cycles and forests in graphs |
| volume_link | (DE-604)BV011638881 |
| work_keys_str_mv | AT schustergeraldw aminimumdegreeresultfordisjointcyclesandforestsingraphs |