One-Factorizations:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Boston, MA
Springer US
1997
|
| Schriftenreihe: | Mathematics and Its Applications
390 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | This book has grown out of graduate courses given by the author at Southern Illinois University, Carbondale, as well as a series of seminars delivered at Curtin University of Technology, Western Australia. The book is intended to be used both as a textbook at the graduate level and also as a professional reference. The topic of one-factorizations fits into the theory of combinatorial designs just as much as it does into graph theory. Factors and factorizations occur as building blocks in the theory of designs in a number of places. Our approach owes as much to design theory as it does to graph theory. It is expected that nearly all readers will have some background in the theory of graphs, such as an advanced undergraduate course in Graph Theory or Applied Graph Theory. However, the book is self-contained, and the first two chapters are a thumbnail sketch of basic graph theory. Many readers will merely skim these chapters, observing our notational conventions along the way. (These introductory chapters could, in fact, enable some instructors to Ilse the book for a somewhat eccentric introduction to graph theory.) Chapter 3 introduces one-factors and one-factorizations. The next two chapters outline two major application areas: combinatorial arrays and tournaments. These two related areas have provided the impetus for a good deal of study of one-factorizations |
| Beschreibung: | 1 Online-Ressource (XIV, 242 p) |
| ISBN: | 9781475725643 9781441947666 |
| DOI: | 10.1007/978-1-4757-2564-3 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042421361 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s1997 |||| o||u| ||||||eng d | ||
| 020 | |a 9781475725643 |c Online |9 978-1-4757-2564-3 | ||
| 020 | |a 9781441947666 |c Print |9 978-1-4419-4766-6 | ||
| 024 | 7 | |a 10.1007/978-1-4757-2564-3 |2 doi | |
| 035 | |a (OCoLC)879622954 | ||
| 035 | |a (DE-599)BVBBV042421361 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
| 082 | 0 | |a 004.0151 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Wallis, W. D. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a One-Factorizations |c by W. D. Wallis |
| 264 | 1 | |a Boston, MA |b Springer US |c 1997 | |
| 300 | |a 1 Online-Ressource (XIV, 242 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Mathematics and Its Applications |v 390 | |
| 500 | |a This book has grown out of graduate courses given by the author at Southern Illinois University, Carbondale, as well as a series of seminars delivered at Curtin University of Technology, Western Australia. The book is intended to be used both as a textbook at the graduate level and also as a professional reference. The topic of one-factorizations fits into the theory of combinatorial designs just as much as it does into graph theory. Factors and factorizations occur as building blocks in the theory of designs in a number of places. Our approach owes as much to design theory as it does to graph theory. It is expected that nearly all readers will have some background in the theory of graphs, such as an advanced undergraduate course in Graph Theory or Applied Graph Theory. However, the book is self-contained, and the first two chapters are a thumbnail sketch of basic graph theory. Many readers will merely skim these chapters, observing our notational conventions along the way. (These introductory chapters could, in fact, enable some instructors to Ilse the book for a somewhat eccentric introduction to graph theory.) Chapter 3 introduces one-factors and one-factorizations. The next two chapters outline two major application areas: combinatorial arrays and tournaments. These two related areas have provided the impetus for a good deal of study of one-factorizations | ||
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Combinatorics | |
| 650 | 4 | |a Computer Science | |
| 650 | 4 | |a Discrete Mathematics in Computer Science | |
| 650 | 4 | |a Informatik | |
| 650 | 0 | 7 | |a Zerlegung |g Mathematik |0 (DE-588)4190746-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Zerlegung |g Mathematik |0 (DE-588)4190746-2 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4757-2564-3 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SMA_Archive | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027856778 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804153094314917888 |
|---|---|
| any_adam_object | |
| author | Wallis, W. D. |
| author_facet | Wallis, W. D. |
| author_role | aut |
| author_sort | Wallis, W. D. |
| author_variant | w d w wd wdw |
| building | Verbundindex |
| bvnumber | BV042421361 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)879622954 (DE-599)BVBBV042421361 |
| dewey-full | 004.0151 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.0151 |
| dewey-search | 004.0151 |
| dewey-sort | 14.0151 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| doi_str_mv | 10.1007/978-1-4757-2564-3 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02971nmm a2200481zcb4500</leader><controlfield tag="001">BV042421361</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s1997 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781475725643</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-4757-2564-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781441947666</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-4419-4766-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4757-2564-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)879622954</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042421361</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.0151</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wallis, W. D.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">One-Factorizations</subfield><subfield code="c">by W. D. Wallis</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, MA</subfield><subfield code="b">Springer US</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XIV, 242 p)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Mathematics and Its Applications</subfield><subfield code="v">390</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">This book has grown out of graduate courses given by the author at Southern Illinois University, Carbondale, as well as a series of seminars delivered at Curtin University of Technology, Western Australia. The book is intended to be used both as a textbook at the graduate level and also as a professional reference. The topic of one-factorizations fits into the theory of combinatorial designs just as much as it does into graph theory. Factors and factorizations occur as building blocks in the theory of designs in a number of places. Our approach owes as much to design theory as it does to graph theory. It is expected that nearly all readers will have some background in the theory of graphs, such as an advanced undergraduate course in Graph Theory or Applied Graph Theory. However, the book is self-contained, and the first two chapters are a thumbnail sketch of basic graph theory. Many readers will merely skim these chapters, observing our notational conventions along the way. (These introductory chapters could, in fact, enable some instructors to Ilse the book for a somewhat eccentric introduction to graph theory.) Chapter 3 introduces one-factors and one-factorizations. The next two chapters outline two major application areas: combinatorial arrays and tournaments. These two related areas have provided the impetus for a good deal of study of one-factorizations</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete Mathematics in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Zerlegung</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4190746-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Zerlegung</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4190746-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4757-2564-3</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027856778</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV042421361 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:08Z |
| institution | BVB |
| isbn | 9781475725643 9781441947666 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027856778 |
| oclc_num | 879622954 |
| open_access_boolean | |
| owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| physical | 1 Online-Ressource (XIV, 242 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 1997 |
| publishDateSearch | 1997 |
| publishDateSort | 1997 |
| publisher | Springer US |
| record_format | marc |
| series2 | Mathematics and Its Applications |
| spelling | Wallis, W. D. Verfasser aut One-Factorizations by W. D. Wallis Boston, MA Springer US 1997 1 Online-Ressource (XIV, 242 p) txt rdacontent c rdamedia cr rdacarrier Mathematics and Its Applications 390 This book has grown out of graduate courses given by the author at Southern Illinois University, Carbondale, as well as a series of seminars delivered at Curtin University of Technology, Western Australia. The book is intended to be used both as a textbook at the graduate level and also as a professional reference. The topic of one-factorizations fits into the theory of combinatorial designs just as much as it does into graph theory. Factors and factorizations occur as building blocks in the theory of designs in a number of places. Our approach owes as much to design theory as it does to graph theory. It is expected that nearly all readers will have some background in the theory of graphs, such as an advanced undergraduate course in Graph Theory or Applied Graph Theory. However, the book is self-contained, and the first two chapters are a thumbnail sketch of basic graph theory. Many readers will merely skim these chapters, observing our notational conventions along the way. (These introductory chapters could, in fact, enable some instructors to Ilse the book for a somewhat eccentric introduction to graph theory.) Chapter 3 introduces one-factors and one-factorizations. The next two chapters outline two major application areas: combinatorial arrays and tournaments. These two related areas have provided the impetus for a good deal of study of one-factorizations Computer science Computational complexity Combinatorics Computer Science Discrete Mathematics in Computer Science Informatik Zerlegung Mathematik (DE-588)4190746-2 gnd rswk-swf Zerlegung Mathematik (DE-588)4190746-2 s 1\p DE-604 https://doi.org/10.1007/978-1-4757-2564-3 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Wallis, W. D. One-Factorizations Computer science Computational complexity Combinatorics Computer Science Discrete Mathematics in Computer Science Informatik Zerlegung Mathematik (DE-588)4190746-2 gnd |
| subject_GND | (DE-588)4190746-2 |
| title | One-Factorizations |
| title_auth | One-Factorizations |
| title_exact_search | One-Factorizations |
| title_full | One-Factorizations by W. D. Wallis |
| title_fullStr | One-Factorizations by W. D. Wallis |
| title_full_unstemmed | One-Factorizations by W. D. Wallis |
| title_short | One-Factorizations |
| title_sort | one factorizations |
| topic | Computer science Computational complexity Combinatorics Computer Science Discrete Mathematics in Computer Science Informatik Zerlegung Mathematik (DE-588)4190746-2 gnd |
| topic_facet | Computer science Computational complexity Combinatorics Computer Science Discrete Mathematics in Computer Science Informatik Zerlegung Mathematik |
| url | https://doi.org/10.1007/978-1-4757-2564-3 |
| work_keys_str_mv | AT walliswd onefactorizations |