Circuit double cover of graphs:
The famous Circuit Double Cover conjecture (and its numerous variants) is considered one of the major open problems in graph theory owing to its close relationship with topological graph theory, integer flow theory, graph coloring and the structure of snarks. It is easy to state: every 2-connected g...
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Cambridge
Cambridge University Press
2012
|
| Series: | London Mathematical Society lecture note series
399 |
| Subjects: | |
| Online Access: | BSB01 FHN01 Volltext |
| Summary: | The famous Circuit Double Cover conjecture (and its numerous variants) is considered one of the major open problems in graph theory owing to its close relationship with topological graph theory, integer flow theory, graph coloring and the structure of snarks. It is easy to state: every 2-connected graph has a family of circuits covering every edge precisely twice. C.-Q. Zhang provides an up-to-date overview of the subject containing all of the techniques, methods and results developed to help solve the conjecture since the first publication of the subject in the 1940s. It is a useful survey for researchers already working on the problem and a fitting introduction for those just entering the field. The end-of-chapter exercises have been designed to challenge readers at every level and hints are provided in an appendix |
| Item Description: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Physical Description: | 1 online resource (xxi, 357 pages) |
| ISBN: | 9780511863158 |
| DOI: | 10.1017/CBO9780511863158 |
Staff View
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043942093 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s2012 |||| o||u| ||||||eng d | ||
| 020 | |a 9780511863158 |c Online |9 978-0-511-86315-8 | ||
| 024 | 7 | |a 10.1017/CBO9780511863158 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9780511863158 | ||
| 035 | |a (OCoLC)1047833910 | ||
| 035 | |a (DE-599)BVBBV043942093 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 | ||
| 082 | 0 | |a 511.5 |2 23 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 100 | 1 | |a Zhang, Cun-Quan |d 1952- |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Circuit double cover of graphs |c Cun-Quan Zhang |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2012 | |
| 300 | |a 1 online resource (xxi, 357 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a London Mathematical Society lecture note series |v 399 | |
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 520 | |a The famous Circuit Double Cover conjecture (and its numerous variants) is considered one of the major open problems in graph theory owing to its close relationship with topological graph theory, integer flow theory, graph coloring and the structure of snarks. It is easy to state: every 2-connected graph has a family of circuits covering every edge precisely twice. C.-Q. Zhang provides an up-to-date overview of the subject containing all of the techniques, methods and results developed to help solve the conjecture since the first publication of the subject in the 1940s. It is a useful survey for researchers already working on the problem and a fitting introduction for those just entering the field. The end-of-chapter exercises have been designed to challenge readers at every level and hints are provided in an appendix | ||
| 650 | 4 | |a Graph theory | |
| 650 | 4 | |a Graph theory / Problems, exercises, etc | |
| 650 | 0 | 7 | |a Überdeckung |g Mathematik |0 (DE-588)4186551-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Zusammenhängender Graph |0 (DE-588)4251368-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Überdeckung |g Mathematik |0 (DE-588)4186551-0 |D s |
| 689 | 0 | 1 | |a Zusammenhängender Graph |0 (DE-588)4251368-6 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-28235-2 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511863158 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029351063 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511863158 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511863158 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Record in the Search Index
| _version_ | 1804176884540375040 |
|---|---|
| any_adam_object | |
| author | Zhang, Cun-Quan 1952- |
| author_facet | Zhang, Cun-Quan 1952- |
| author_role | aut |
| author_sort | Zhang, Cun-Quan 1952- |
| author_variant | c q z cqz |
| building | Verbundindex |
| bvnumber | BV043942093 |
| classification_rvk | SK 890 |
| collection | ZDB-20-CBO |
| ctrlnum | (ZDB-20-CBO)CR9780511863158 (OCoLC)1047833910 (DE-599)BVBBV043942093 |
| dewey-full | 511.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.5 |
| dewey-search | 511.5 |
| dewey-sort | 3511.5 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1017/CBO9780511863158 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02812nmm a2200493zcb4500</leader><controlfield tag="001">BV043942093</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s2012 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511863158</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-86315-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511863158</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511863158</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1047833910</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043942093</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.5</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zhang, Cun-Quan</subfield><subfield code="d">1952-</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Circuit double cover of graphs</subfield><subfield code="c">Cun-Quan Zhang</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xxi, 357 pages)</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">London Mathematical Society lecture note series</subfield><subfield code="v">399</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The famous Circuit Double Cover conjecture (and its numerous variants) is considered one of the major open problems in graph theory owing to its close relationship with topological graph theory, integer flow theory, graph coloring and the structure of snarks. It is easy to state: every 2-connected graph has a family of circuits covering every edge precisely twice. C.-Q. Zhang provides an up-to-date overview of the subject containing all of the techniques, methods and results developed to help solve the conjecture since the first publication of the subject in the 1940s. It is a useful survey for researchers already working on the problem and a fitting introduction for those just entering the field. The end-of-chapter exercises have been designed to challenge readers at every level and hints are provided in an appendix</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory / Problems, exercises, etc</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Überdeckung</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4186551-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Zusammenhängender Graph</subfield><subfield code="0">(DE-588)4251368-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Überdeckung</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4186551-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Zusammenhängender Graph</subfield><subfield code="0">(DE-588)4251368-6</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="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-28235-2</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511863158</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029351063</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><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511863158</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511863158</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043942093 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:16Z |
| institution | BVB |
| isbn | 9780511863158 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029351063 |
| oclc_num | 1047833910 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 online resource (xxi, 357 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 2012 |
| publishDateSearch | 2012 |
| publishDateSort | 2012 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | London Mathematical Society lecture note series |
| spelling | Zhang, Cun-Quan 1952- Verfasser aut Circuit double cover of graphs Cun-Quan Zhang Cambridge Cambridge University Press 2012 1 online resource (xxi, 357 pages) txt rdacontent c rdamedia cr rdacarrier London Mathematical Society lecture note series 399 Title from publisher's bibliographic system (viewed on 05 Oct 2015) The famous Circuit Double Cover conjecture (and its numerous variants) is considered one of the major open problems in graph theory owing to its close relationship with topological graph theory, integer flow theory, graph coloring and the structure of snarks. It is easy to state: every 2-connected graph has a family of circuits covering every edge precisely twice. C.-Q. Zhang provides an up-to-date overview of the subject containing all of the techniques, methods and results developed to help solve the conjecture since the first publication of the subject in the 1940s. It is a useful survey for researchers already working on the problem and a fitting introduction for those just entering the field. The end-of-chapter exercises have been designed to challenge readers at every level and hints are provided in an appendix Graph theory Graph theory / Problems, exercises, etc Überdeckung Mathematik (DE-588)4186551-0 gnd rswk-swf Zusammenhängender Graph (DE-588)4251368-6 gnd rswk-swf Überdeckung Mathematik (DE-588)4186551-0 s Zusammenhängender Graph (DE-588)4251368-6 s 1\p DE-604 Erscheint auch als Druckausgabe 978-0-521-28235-2 https://doi.org/10.1017/CBO9780511863158 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Zhang, Cun-Quan 1952- Circuit double cover of graphs Graph theory Graph theory / Problems, exercises, etc Überdeckung Mathematik (DE-588)4186551-0 gnd Zusammenhängender Graph (DE-588)4251368-6 gnd |
| subject_GND | (DE-588)4186551-0 (DE-588)4251368-6 |
| title | Circuit double cover of graphs |
| title_auth | Circuit double cover of graphs |
| title_exact_search | Circuit double cover of graphs |
| title_full | Circuit double cover of graphs Cun-Quan Zhang |
| title_fullStr | Circuit double cover of graphs Cun-Quan Zhang |
| title_full_unstemmed | Circuit double cover of graphs Cun-Quan Zhang |
| title_short | Circuit double cover of graphs |
| title_sort | circuit double cover of graphs |
| topic | Graph theory Graph theory / Problems, exercises, etc Überdeckung Mathematik (DE-588)4186551-0 gnd Zusammenhängender Graph (DE-588)4251368-6 gnd |
| topic_facet | Graph theory Graph theory / Problems, exercises, etc Überdeckung Mathematik Zusammenhängender Graph |
| url | https://doi.org/10.1017/CBO9780511863158 |
| work_keys_str_mv | AT zhangcunquan circuitdoublecoverofgraphs |