Sökning: "cycle decompositions"

Hittade 2 avhandlingar innehållade orden cycle decompositions.

1. 1. Snarks : Generation, coverings and colourings

   Författare :Jonas Hägglund; Roland Häggkvist; Klas Markström; Luis Goddyn; Umeå universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Snarks; cubic graphs; enumeration; cycle covers; perfect matching covers; Fulkerson s conjecture; strong cycle double cover conjecture; cycle decompositions; stable cycles; oddness; circumference; uncolourability measures; Mathematics; matematik;

   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

3. 2. Essays on Poverty, Risk and Consumption Dynamics in Ethiopia

   Författare :Abebe Shimeles; Göteborgs universitet; []
   Nyckelord :SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; Ethiopia; poverty; income distribution; policy simulations; poverty spells; vulnerability; chronic poverty; consumption risk; transitory shocks; liquidity constraints; poverty traps.;

   Sammanfattning : Paper 1. This paper analysed the state of poverty and income distribution in rural and urban Ethiopia during 1994-2000. Poverty declined from 1994 to 1997, and then increased to 2000. LÄS MER