Sökning: "perfect matching covers"
Hittade 2 avhandlingar innehållade orden perfect matching covers.
1. Snarks : Generation, coverings and colourings
Sammanfattning : 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. LÄS MER
2. On random cover and matching problems
Sammanfattning : This thesis consists of the following papers.I J. Larsson, The Minimum Matching in Pseudo-dimension 0 < q < 1, submittedII V. Falgas-Ravry, J. LÄS MER