Splitter theorems for 4-regular graphs

Document Type

Article

Publication Date

3-8-2010

Abstract

Let Φk,g be the class of all k-edge connected 4-regular graphs with girth of at least g. For several choices of k and g, we determine a set Ok,g of graph operations, for which, if G and H are graphs in Φk,g, G ≠ H, and G contains H as an immersion, then some operation in Ok,g can be applied to G to result in a smaller graph G′ in Φk,g such that, on one hand, G′ is immersed in G, and on the other hand, G′ contains H as an immersion. © 2010 Springer.

Publication Source (Journal or Book title)

Graphs and Combinatorics

First Page

329

Last Page

344

This document is currently not available here.

Share

COinS