Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Entire DC Network
Splitter Theorems For 3- And 4-Regular Graphs, Jinko Kanno
Splitter Theorems For 3- And 4-Regular Graphs, Jinko Kanno
LSU Doctoral Dissertations
Let g be a class of graphs and ≤ be a graph containment relation. A splitter theorem for g under ≤ is a result that claims the existence of a set O of graph operations such that if G and H are in g and H≤G with G≠H, then there is a decreasing sequence of graphs from G to H, say G=G0≥G1≥G2...Gt=H, all intermediate graphs are in g, and each Gi can be obtained from Gi-1 by applying a single …