b'@phdthesis{Issacphd2019,'b'\nTITLE = {On Some Covering, Partition and Connectivity Problems in Graphs},\nAUTHOR = {Issac, Davis},\nLANGUAGE = {eng},\nURL = {urn:nbn:de:bsz:291--ds-296205},\nDOI = {10.22028/D291-29620},\nSCHOOL = {Universit{\\"a}t des Saarlandes},\nADDRESS = {Saarbr{\\"u}cken},\nYEAR = {2019},\nDATE = {2019},\nABSTRACT = {We look at some graph problems related to covering, partition, and connectivity. First, we study the problems of covering and partitioning edges with bicliques, especially from the viewpoint of parameterized complexity. For the partition problem, we develop much more efficient algorithms than the ones previously known. In contrast, for the cover problem, our lower bounds show that the known algorithms are probably optimal. Next, we move on to graph coloring, which is probably the most extensively studied partition problem in graphs. Hadwiger{\\textquoteright}s conjecture is a long-standing open problem related to vertex coloring. We prove the conjecture for a special class of graphs, namely squares of 2-trees, and show that square graphs are important in connection with Hadwiger{\\textquoteright}s conjecture. Then, we study a coloring problem that has been emerging recently, called rainbow coloring. This problem lies in the intersection of coloring and connectivity. We study different variants of rainbow coloring and present bounds and complexity results on them. Finally, we move on to another parameter related to connectivity called spanning tree congestion (STC). We give tight bounds for STC in general graphs and random graphs. While proving the results on},\n}\n'