CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_upper_j_idt169",{id:"formSmash:upper:j_idt169",widgetVar:"widget_formSmash_upper_j_idt169",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:upper:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_upper_j_idt170_j_idt173",{id:"formSmash:upper:j_idt170:j_idt173",widgetVar:"widget_formSmash_upper_j_idt170_j_idt173",target:"formSmash:upper:j_idt170:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

Snarks: Generation, coverings and colouringsPrimeFaces.cw("AccordionPanel","widget_formSmash_some",{id:"formSmash:some",widgetVar:"widget_formSmash_some",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_all",{id:"formSmash:all",widgetVar:"widget_formSmash_all",multiple:true});
function selectAll()
{
var panelSome = $(PrimeFaces.escapeClientId("formSmash:some"));
var panelAll = $(PrimeFaces.escapeClientId("formSmash:all"));
panelAll.toggle();
toggleList(panelSome.get(0).childNodes, panelAll);
toggleList(panelAll.get(0).childNodes, panelAll);
}
/*Toggling the list of authorPanel nodes according to the toggling of the closeable second panel */
function toggleList(childList, panel)
{
var panelWasOpen = (panel.get(0).style.display == 'none');
// console.log('panel was open ' + panelWasOpen);
for (var c = 0; c < childList.length; c++) {
if (childList[c].classList.contains('authorPanel')) {
clickNode(panelWasOpen, childList[c]);
}
}
}
/*nodes have styleClass ui-corner-top if they are expanded and ui-corner-all if they are collapsed */
function clickNode(collapse, child)
{
if (collapse && child.classList.contains('ui-corner-top')) {
// console.log('collapse');
child.click();
}
if (!collapse && child.classList.contains('ui-corner-all')) {
// console.log('expand');
child.click();
}
}
PrimeFaces.cw("AccordionPanel","widget_formSmash_responsibleOrgs",{id:"formSmash:responsibleOrgs",widgetVar:"widget_formSmash_responsibleOrgs",multiple:true}); 2012 (English)Doctoral thesis, comprehensive summary (Other academic)
##### Abstract [en]

##### Place, publisher, year, edition, pages

Umeå: Umeå universitet , 2012. , 69 p.
##### Series

Doctoral thesis / Umeå University, Department of Mathematics, ISSN 1102-8300 ; 53
##### Keyword [en]

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
##### National Category

Discrete Mathematics
##### Research subject

Mathematics
##### Identifiers

URN: urn:nbn:se:umu:diva-53337ISBN: 978-91-7459-399-0 (print)OAI: oai:DiVA.org:umu-53337DiVA: diva2:511537
##### Public defence

2012-04-13, MIT-huset, MA121, Umeå universitet, Umeå, 13:15 (English)
##### Opponent

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt478",{id:"formSmash:j_idt478",widgetVar:"widget_formSmash_j_idt478",multiple:true});
##### Supervisors

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt484",{id:"formSmash:j_idt484",widgetVar:"widget_formSmash_j_idt484",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt490",{id:"formSmash:j_idt490",widgetVar:"widget_formSmash_j_idt490",multiple:true});
Available from: 2012-03-23 Created: 2012-03-21 Last updated: 2013-09-05Bibliographically approved
##### List of papers

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. Snarks and problems for which an edge minimal counterexample must be a snark are the central topics of this thesis.

The first part of this thesis is intended as a short introduction to the area. The second part is an introduction to the appended papers and the third part consists of the four papers presented in a chronological order.

In Paper I we study the strong cycle double cover conjecture and stable cycles for small snarks. We prove that if a bridgeless cubic graph $G$ has a cycle of length at least $|V(G)|-9$ then it also has a cycle double cover. Furthermore we show that there exist cyclically 5-edge connected snarks with stable cycles and that there exists an infinite family of snarks with stable cycles of length 24.

In Paper II we present a new algorithm for generating all non-isomorphic snarks with a given number of vertices. We generate all snarks on 36 vertices and less and study these with respect to various properties. We find that a number of conjectures on cycle covers and colourings holds for all graphs of these orders. Furthermore we present counterexamples to no less than eight published conjectures on cycle coverings, cycle decompositions and the general structure of regular graphs.

In Paper III we show that Jaeger's Petersen colouring conjecture holds for three infinite families of snarks and that a minimum counterexample to this conjecture cannot contain a certain subdivision of $K_{3,3}$ as a subgraph. Furthermore, it is shown that one infinite family of snarks have strong Petersen colourings while another does not have any such colourings.

Two simple constructions for snarks with arbitrary high oddness and resistance is given in Paper IV. It is observed that some snarks obtained from this construction have the property that they require at least five perfect matchings to cover the edges. This disproves a suggested strengthening of Fulkerson's conjecture.

1. On stable cycles and cycle double covers of graphs with large circumference$(function(){PrimeFaces.cw("OverlayPanel","overlay511319",{id:"formSmash:j_idt526:0:j_idt530",widgetVar:"overlay511319",target:"formSmash:j_idt526:0:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

2. Generation and properties of snarks$(function(){PrimeFaces.cw("OverlayPanel","overlay645647",{id:"formSmash:j_idt526:1:j_idt530",widgetVar:"overlay645647",target:"formSmash:j_idt526:1:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

3. Petersen-colorings and some families of snarks$(function(){PrimeFaces.cw("OverlayPanel","overlay511375",{id:"formSmash:j_idt526:2:j_idt530",widgetVar:"overlay511375",target:"formSmash:j_idt526:2:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

4. On snarks that are far from being 3-edge colorable$(function(){PrimeFaces.cw("OverlayPanel","overlay511373",{id:"formSmash:j_idt526:3:j_idt530",widgetVar:"overlay511373",target:"formSmash:j_idt526:3:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

isbn
urn-nbn$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_j_idt1188",{id:"formSmash:j_idt1188",widgetVar:"widget_formSmash_j_idt1188",showEffect:"fade",hideEffect:"fade",showDelay:500,hideDelay:300,target:"formSmash:altmetricDiv"});});

CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_lower_j_idt1241",{id:"formSmash:lower:j_idt1241",widgetVar:"widget_formSmash_lower_j_idt1241",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:lower:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_lower_j_idt1242_j_idt1244",{id:"formSmash:lower:j_idt1242:j_idt1244",widgetVar:"widget_formSmash_lower_j_idt1242_j_idt1244",target:"formSmash:lower:j_idt1242:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});