O'Reilly logo

Circuit Double Cover of Graphs by Cun-Quan Zhang

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Glossary of terms and symbols

All graphs considered in this book may contain parallel edges or loops.

For most basic terminology and notation in graph theory, we follow some popularly used textbooks, such as, [18], [19], [34], [41], [92], [242], etc.

acyclic: A graph is acyclic if it contains no circuit.

admissible forbidden system: A forbidden system P is admissible if |PT| ≤ imagesT| for every forbidden part PP and every edge-cut T of G.

admissible weight: A weight w : E(G) images * is admissible if, for each edge-cut T and each edge eT, w(T) ≥ 2 ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required