Splitter Theorems for 3- and 4-Regular Graphs
Let <i>g</i> be a class of graphs and ≤ be a graph containment relation. A splitter theorem for <i>g</i> under ≤ is a result that claims the existence of a set <i>O</i> of graph operations such that if <i>G</i> and <i>H</i> are in <i>...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
LSU
2003
|
| Subjects: | |
| Online Access: | http://etd.lsu.edu/docs/available/etd-0529103-123537/ |