Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-24T03:36:41.660Z Has data issue: false hasContentIssue false
  • English
  • Français

Splitter Theorems for Cubic Graphs

Published online by Cambridge University Press:  07 April 2006

GUOLI DING  and
JINKO KANNO
GUOLI DING
Affiliation:
Department of Mathematics, Louisiana State University, Baton Rouge, Louisiana 70803, USA (e-mail: [email protected])
JINKO KANNO
Affiliation:
Mathematics and Statistics Program, Louisiana Tech University, Ruston, Louisiana 71272, USA (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

Let $\Gamma_{k,g}$ be the class of $k$-connected cubic graphs of girth at least $g$. For several choices of $k$ and $g$, we determine a set ${\cal O}_{k,g}$ of graph operations, for which, if $G$ and $H$ are graphs in $\Gamma_{k,g}$, $G\not\cong H$, and $G$ contains $H$ topologically, then some operation in ${\cal O}_{k,g}$ can be applied to $G$ to result in a smaller graph $G'$ in $\Gamma_{k,g}$ such that, on one hand, $G'$ is contained in $G$ topologically, and on the other hand, $G'$ contains $H$ topologically.

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 15 , Issue 3 , May 2006 , pp. 355 - 375
Copyright
2006 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)