Name
Abstract | ||
|---|---|---|
Let $${\Phi_{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 $${\mathcal{O}_{k,g}}$$ of graph operations, for which, if G and H are graphs in $${\Phi_{k,g}}$$, G ≠ H, and G contains H as an immersion, then some operation in $${\mathcal{O}_{k,g}}$$ can be applied to G to result in a smaller graph G′ in $${\Phi_{k,g}}$$ such that, on one hand, G′ is immersed in G, and on the other hand, G′ contains H as an immersion. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/s00373-010-0916-y | Graphs and Combinatorics |
Keywords | Field | DocType |
splitter theorem · immersion · 4-regular graphs · generating theorem · graph operations,regular graph | Graph operations,Discrete mathematics,Topology,Graph,Combinatorics,Splitter,New digraph reconstruction conjecture,Mathematics | Journal |
Volume | Issue | ISSN |
26 | 3 | 1435-5914 |
Citations | PageRank | References |
1 | 0.38 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guoli Ding | 1 | 444 | 51.58 |
| Jinko Kanno | 2 | 23 | 6.03 |