Circuit Double Cover of Graphs
Saved in:
| Title: | Circuit Double Cover of Graphs |
|---|---|
| Description: | 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. |
| Authors: | Cun-Quan Zhang |
| Resource Type: | eBook. |
| Subjects: | Graph theory, Graph theory--Problems, exercises, etc |
| Categories: | MATHEMATICS / Graphic Methods |
| Database: | eBook Collection (EBSCOhost) |
| FullText | Links: – Type: ebook-pdf Text: Availability: 0 |
|---|---|
| Header | DbId: nlebk DbLabel: eBook Collection (EBSCOhost) An: 443712 RelevancyScore: 1044 AccessLevel: 6 PubType: eBook PubTypeId: ebook PreciseRelevancyScore: 1044.26904296875 |
| IllustrationInfo | |
| ImageInfo | – Size: thumb Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$443712$PDF&s=r – Size: medium Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$443712$PDF&s=d |
| Items | – Name: Title Label: Title Group: Ti Data: Circuit Double Cover of Graphs – Name: Abstract Label: Description Group: Ab Data: 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. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Cun-Quan+Zhang%22">Cun-Quan Zhang</searchLink> – Name: TypePub Label: Resource Type Group: TypPub Data: eBook. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Graph+theory%22">Graph theory</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+theory--Problems%2C+exercises%2C+etc%22">Graph theory--Problems, exercises, etc</searchLink> – Name: SubjectBISAC Label: Categories Group: Su Data: <searchLink fieldCode="ZK" term="%22MATHEMATICS+%2F+Graphic+Methods%22">MATHEMATICS / Graphic Methods</searchLink> |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=nlebk&AN=443712 |
| RecordInfo | BibRecord: BibEntity: Classifications: – Code: 511.5 Scheme: ddc Type: prePub – Code: 511.5 Scheme: ddc Type: prePub Languages: – Code: eng Text: English Subjects: – SubjectFull: Graph theory Type: general – SubjectFull: Graph theory--Problems, exercises, etc Type: general Titles: – TitleFull: Circuit Double Cover of Graphs Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Cun-Quan Zhang – PersonEntity: Name: NameFull: Cun-Quan Zhang IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Type: published Y: 2012 – D: 04 M: 02 Type: profile Y: 2014 Identifiers: – Type: isbn-print Value: 9780521282352 – Type: isbn-electronic Value: 9781139379304 Numbering: – Type: volume Value: 00399 Titles: – TitleFull: Circuit Double Cover of Graphs Type: main |
| ResultId | 1 |