Which claw-free graphs are perfectly orderable?:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Bonn
1990
|
| Schriftenreihe: | Forschungsinstitut für Diskrete Mathematik <Bonn>: Report
653 |
| Beschreibung: | 29 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV004233939 | ||
| 003 | DE-604 | ||
| 005 | 19930804 | ||
| 007 | t | ||
| 008 | 910107s1990 gw d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)60303870 | ||
| 035 | |a (DE-599)BVBBV004233939 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-12 | ||
| 100 | 1 | |a Chvátal, Vašek |d 1946- |e Verfasser |0 (DE-588)110721772 |4 aut | |
| 245 | 1 | 0 | |a Which claw-free graphs are perfectly orderable? |c by Vašek Chvátal |
| 264 | 1 | |a Bonn |c 1990 | |
| 300 | |a 29 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Forschungsinstitut für Diskrete Mathematik <Bonn>: Report |v 653 | |
| 830 | 0 | |a Forschungsinstitut für Diskrete Mathematik <Bonn>: Report |v 653 |w (DE-604)BV001337780 |9 653 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-002634780 | ||
Datensatz im Suchindex
| _version_ | 1804118431201492992 |
|---|---|
| any_adam_object | |
| author | Chvátal, Vašek 1946- |
| author_GND | (DE-588)110721772 |
| author_facet | Chvátal, Vašek 1946- |
| author_role | aut |
| author_sort | Chvátal, Vašek 1946- |
| author_variant | v c vc |
| building | Verbundindex |
| bvnumber | BV004233939 |
| ctrlnum | (OCoLC)60303870 (DE-599)BVBBV004233939 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00890nam a2200277 cb4500</leader><controlfield tag="001">BV004233939</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19930804 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">910107s1990 gw d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)60303870</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV004233939</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="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">Chvátal, Vašek</subfield><subfield code="d">1946-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)110721772</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Which claw-free graphs are perfectly orderable?</subfield><subfield code="c">by Vašek Chvátal</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Bonn</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">29 S.</subfield><subfield code="b">graph. Darst.</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">Forschungsinstitut für Diskrete Mathematik <Bonn>: Report</subfield><subfield code="v">653</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Forschungsinstitut für Diskrete Mathematik <Bonn>: Report</subfield><subfield code="v">653</subfield><subfield code="w">(DE-604)BV001337780</subfield><subfield code="9">653</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002634780</subfield></datafield></record></collection> |
| id | DE-604.BV004233939 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T16:10:11Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002634780 |
| oclc_num | 60303870 |
| open_access_boolean | |
| owner | DE-12 |
| owner_facet | DE-12 |
| physical | 29 S. graph. Darst. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series | Forschungsinstitut für Diskrete Mathematik <Bonn>: Report |
| series2 | Forschungsinstitut für Diskrete Mathematik <Bonn>: Report |
| spelling | Chvátal, Vašek 1946- Verfasser (DE-588)110721772 aut Which claw-free graphs are perfectly orderable? by Vašek Chvátal Bonn 1990 29 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Forschungsinstitut für Diskrete Mathematik <Bonn>: Report 653 Forschungsinstitut für Diskrete Mathematik <Bonn>: Report 653 (DE-604)BV001337780 653 |
| spellingShingle | Chvátal, Vašek 1946- Which claw-free graphs are perfectly orderable? Forschungsinstitut für Diskrete Mathematik <Bonn>: Report |
| title | Which claw-free graphs are perfectly orderable? |
| title_auth | Which claw-free graphs are perfectly orderable? |
| title_exact_search | Which claw-free graphs are perfectly orderable? |
| title_full | Which claw-free graphs are perfectly orderable? by Vašek Chvátal |
| title_fullStr | Which claw-free graphs are perfectly orderable? by Vašek Chvátal |
| title_full_unstemmed | Which claw-free graphs are perfectly orderable? by Vašek Chvátal |
| title_short | Which claw-free graphs are perfectly orderable? |
| title_sort | which claw free graphs are perfectly orderable |
| volume_link | (DE-604)BV001337780 |
| work_keys_str_mv | AT chvatalvasek whichclawfreegraphsareperfectlyorderable |