Circuit Double Cover of Graphs (London Mathematical Society by Cun-Quan Zhang

By Cun-Quan Zhang

The well-known Circuit Double hide conjecture (and its a number of versions) is taken into account one of many significant open difficulties in graph conception as a result of its shut courting with topological graph thought, integer circulation concept, graph coloring and the constitution of snarks. one can kingdom: each 2-connected graph has a relatives of circuits masking each aspect accurately two times. C.-Q. Zhang offers an updated review of the topic containing all the concepts, equipment and effects constructed to aid remedy the conjecture because the first book of the topic within the Nineteen Forties. it's a helpful survey for researchers already engaged on the matter and a becoming advent for these simply getting into the sector. The end-of-chapter workouts were designed to problem readers at each point and tricks are supplied in an appendix.

Show description

Read or Download Circuit Double Cover of Graphs (London Mathematical Society Lecture Note Series, 399) PDF

Similar discrete mathematics books

Constrained Coding and Soft Iterative Decoding (The Springer International Series in Engineering and Computer Science)

Limited Coding and tender Iterative interpreting is the first paintings to mix the problems of restricted coding and delicate iterative interpreting (e. g. , faster and LDPC codes) from a unified aspect of view. in view that restricted coding is usual in magnetic and optical garage, it will be significant to exploit a few targeted concepts (modified concatenation scheme or bit insertion) so as to practice gentle iterative deciphering.

Multiobjective Programming and Planning (Dover Books on Computer Science)

This article takes a vast view of multiobjective programming, emphasizing the tools most valuable for non-stop difficulties. It studies multiobjective programming tools within the context of public decision-making difficulties, constructing each one challenge inside of a context that addresses sensible features of making plans concerns.

Stochastic Local Search: Foundations and Applications (The Morgan Kaufmann Series in Artificial Intelligence)

Stochastic neighborhood seek (SLS) algorithms are one of the such a lot well-liked and profitable concepts for fixing computationally tough difficulties in lots of components of laptop technology and operations learn, together with propositional satisfiability, constraint pride, routing, and scheduling. SLS algorithms have additionally develop into more and more renowned for fixing difficult combinatorial difficulties in lots of program parts, akin to e-commerce and bioinformatics.

An Introduction to Numerical Computation

Constructed in the course of ten years of educating adventure, this e-book serves as a collection of lecture notes for an introductory path on numerical computation, on the senior undergraduate point. those notes comprise the fabric that may be coated in a semester, including a couple of not obligatory sections for extra studying.

Extra resources for Circuit Double Cover of Graphs (London Mathematical Society Lecture Note Series, 399)

Example text

Download PDF sample

Rated 4.82 of 5 – based on 23 votes