E-viri
Recenzirano
-
Ding, Guoli; Kanno, Jinko
Graphs and combinatorics, 05/2010, Letnik: 26, Številka: 3Journal Article
Let 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 of graph operations, for which, if G and H are graphs in , G ≠ H , and G contains H as an immersion, then some operation in can be applied to G to result in a smaller graph G ′ in such that, on one hand, G ′ is immersed in G , and on the other hand, G ′ contains H as an immersion.
