Search for dissertations about: "graph enumeration"
Found 3 swedish dissertations containing the words graph enumeration.
-
1. Enumeration on words, complexes and polytopes
Abstract : This thesis presents four papers, studying enumerative problems on combinatorial structures. The first paper studies Forman's discrete Morse theory in the case where a group acts on the underlying complex. READ MORE
-
2. Snarks : Generation, coverings and colourings
Abstract : For a number of unsolved problems in graph theory such as the cycle double cover conjecture, Fulkerson's conjecture and Tutte's 5-flow conjecture it is sufficient to prove them for a family of graphs called snarks. Named after the mysterious creature in Lewis Carroll's poem, a \emph{snark} is a cyclically 4-edge connected 3-regular graph of girth at least 5 which cannot be properly edge coloured using three colours. READ MORE
-
3. Topics in algorithmic, enumerative and geometric combinatorics
Abstract : This thesis presents five papers, studying enumerative and extremal problems on combinatorial structures. The first paper studies Forman's discrete Morse theory in the case where a group acts on the underlying complex. READ MORE