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 1 of 1 for “"Planar Rainbow Turan Problem"”.
-
Product Structure, Separating Systems, Freeze-Tag Problem, and Planar Multicolor Turan Number
… focuses on the Product Structure Theorem for planar graphs, which asserts that any planar graph can be embedded in the strong product of a planar 3-tree, a path, and a 3-cycle. The paper presents a simple linear-time algorithm to find this decomposition for an n-vertex planar graph, improving …