Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 25 for “"Cubic graphs"”.
-
Some results on cubic graphs
… of the dissertation involve an operation on cubic graphs called the switch; in the literature, a similar operation is known as the edge slide. In Chapter 2, the author proves that we can transform, with switches, any connected, cubic graph on n vertices into any other connected, cubic graph …
-
Enumeration of general cubic graphs
Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 2000
-
Approximate edge 3-coloring of cubic graphs
… edge 3-coloring polynomial time algorithm for cubic graphs. For any cubic graph with n vertices, using this coloring algorithm, we get an edge 3-coloring with at most n/3 error vertices. In the second part, we study Jim Propp's Rotor-Router model on some non-bipartite graph. We find the …
-
Surjectivity of the Wahl Map on Cubic Graphs
… this problem by converting graph curves to dual graphs. Then the information for graphs can be used to study the underlying curves. We will discuss conditions for the Wahl map to be surjective on a cubic graph. The Wahl map on a cubic graph has two parts, one map onto the vertices and another …
-
Perfect Matching and Circuit Cover of Graphs
… circuit double cover conjecture for bridgeless cubic graphs.;It is well known that every edge-3-colorable cubic graph has a circuit double cover. The structures of edge-3-colorable cubic graphs have strong connections with the circuit double cover conjecture. In chapter two, we consider the …
-
On the analysis of SRG(85, 14, 3, 2)
… feasible set of parameters of strongly regular graphs, (v,k,λ,µ) = (85,14,3,2). We start with the general properties of the 34dimensional Euclidean representation of such a graph G, and then focus on the special subgraphs called segments, which are edge complements in the local subgraphs of G. …
-
Tutte paths and even covers
… the number of components is bounded for circuit graphs, a natural family of planar graphs which generalizes 3-connected planar graphs. As a consequence, we obtain a sharp lower bound for the circumference of essentially 4-connected planar graphs, answering a conjecture of Fabrici, Harant, Mohr, …
-
Cyclically 5-Connected Graphs
… Thomas, Sanders and Seymour has proved the cubic version of this conjecture. Their strategy involved the study of the class of cyclically 5-connected cubic graphs. It turns out a minimum counterexample to the general Four-Flow Conjecture is also cyclically 5-connected. Motivated by this …
-
Finding a Second Hamiltonian cycle in Barnette Graphs
… and (2) finding a second Hamiltonian cycle in cubic graphs. The existence of solution for both problems is guaranteed by a parity argument. For the first problem we prove that deciding whether a 2-oik has a room-partitioning is NP-hard, even if the 2-oik corresponds to a planar triangulation. …
-
Designs on Cubic Multigraphs
… are found for the existence of graph designs on cubic multigraphs. It is shown that, with a few given exceptions, these conditions are sufficient for all connected cubic multigraphs on six or fewer vertices, and for four of the five disconnected ones. Partial results are obtained for the …
-
Well-covered Graphs, Unique Colorability, and Covering Range
… of edges necessary for uniquely (k+1)-colorable graphs. We introduce the k-frames, a new class of minimal uniquely (k+1)-colorable graphs that generalizes the k-trees. The covering range of a graph is the difference between the cardinality of a largest maximal independent set of a graph and the …
-
The computational complexity of edge colouring restricted graphs
… complexity of edge colouring restricted graphs. Previous work has established that the chromatic index problem restricted to k-regular graphs for any fixed k-3 remains NP-complete, whereas the problem restricted to bipartite graphs and partial k-trees for fixed k is in P. We show that …
-
Mixed covering arrays on graphs and tabu search algorithms
… networks and circuits. Mixed covering arrays on graphs are new generalizations of both mixed covering arrays and covering arrays on graphs. In this thesis, we give new theoretical results and constructions for mixed covering arrays on graphs. First, we extend to the mixed case the work done by …
-
Correspondence Colouring and its Applications to List Colouring and Delay Colouring
… is a result by Georgakopoulos, stating that cubic graphs are 4-delay colourable. We show that delay colouring can be formulated as an instance of correspondence colouring. Then we show that the modified line graph of a cubic bipartite graph is generally 4-correspondence colourable, using a …
-
Theoretical and Experimental Studies on the Minimum Size 2-edge-connected Spanning Subgraph Problem
… algorithm is presented for 2EC on bridgeless cubic graphs which guarantees to be within 5/4 of the optimal solution value, improving on the previous best proven approximation guarantee of 5/4+ε for this problem. We also focus on the linear programming (LP) relaxation of 2EC, which provides …
-
Novel Techniques for the Zero-Forcing and p-Median Graph Location Problems
… bounds on the zero-forcing iteration index for cubic graphs. This thesis also introduces a special type of graph structure, a zero-forcing fort, that provides a powerful tool for the analysis and modeling of zero-forcing problems. In the computational section, I introduce multiple integer …
-
Limited broadcast domination
… multipacking number. Chapter 4 focuses on cubic and subcubic graphs. Here we give an upper bound for the 2-limited broadcast domination number of (C_4, C_6)-free cubic graphs. In Chapter 5, we describe algorithms which determine the k-limited broadcast domination number for strongly chordal …
-
Approximation algorithms and inapproximability of partition functions of spin systems
… for counting the number of 4-colourings on cubic graphs and sampling from the Potts model on random regular graphs in the uniqueness regime.</p> <p>In the complexity part, a classification result for the complexity of approximate counting Boolean Constraint Satisfaction Problems on …
-
The complexity of counting problems
… given for the Tutte polynomial of the complete graphs and complete bipartite graphs, which can be solved at certain points. The flow polynomials of a particular family of cubic graphs are shown to have arbitrarily large zeros, in contrast to the conjectured behaviour of the zeros of the …
-
Connectivity of Matroids and Polymatroids
… a class of binary matroids that generalizes cubic graphs. Specifically, attention is focused on binary matroids having a cocircuit basis where every cocircuit in the basis, as well as the symmetric difference of all these cocircuits, has precisely three elements.
Page 1 of 2