umu.sePublications

Please wait ... |

Refine search result

CiteExportLink to result list
http://umu.diva-portal.org/smash/resultList.jsf?query=&language=en&searchType=SIMPLE&noOfRows=50&sortOrder=author_sort_asc&sortOrder2=title_sort_asc&onlyFullText=false&sf=all&aq=%5B%5B%7B%22journalId%22%3A%227428%22%7D%5D%5D&aqe=%5B%5D&aq2=%5B%5B%5D%5D&af=%5B%5D $(function(){PrimeFaces.cw("InputTextarea","widget_formSmash_upper_j_idt1166_recordPermLink",{id:"formSmash:upper:j_idt1166:recordPermLink",widgetVar:"widget_formSmash_upper_j_idt1166_recordPermLink",autoResize:true});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_upper_j_idt1166_j_idt1168",{id:"formSmash:upper:j_idt1166:j_idt1168",widgetVar:"widget_formSmash_upper_j_idt1166_j_idt1168",target:"formSmash:upper:j_idt1166:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

Permanent link

Cite

Citation styleapa ieee modern-language-association-8th-edition vancouver Other style $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_upper_j_idt1184",{id:"formSmash:upper:j_idt1184",widgetVar:"widget_formSmash_upper_j_idt1184",behaviors:{change:function(ext) {PrimeFaces.ab({s:"formSmash:upper:j_idt1184",e:"change",f:"formSmash",p:"formSmash:upper:j_idt1184",u:"formSmash:upper:otherStyle"},ext);}}});});

- apa
- ieee
- modern-language-association-8th-edition
- vancouver
- Other style

Languagede-DE en-GB en-US fi-FI nn-NO nn-NB sv-SE Other locale $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_upper_j_idt1195",{id:"formSmash:upper:j_idt1195",widgetVar:"widget_formSmash_upper_j_idt1195",behaviors:{change:function(ext) {PrimeFaces.ab({s:"formSmash:upper:j_idt1195",e:"change",f:"formSmash",p:"formSmash:upper:j_idt1195",u:"formSmash:upper:otherLanguage"},ext);}}});});

- de-DE
- en-GB
- en-US
- fi-FI
- nn-NO
- nn-NB
- sv-SE
- Other locale

Output formathtml text asciidoc rtf $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_upper_j_idt1205",{id:"formSmash:upper:j_idt1205",widgetVar:"widget_formSmash_upper_j_idt1205"});});

- html
- text
- asciidoc
- rtf

Rows per page

- 5
- 10
- 20
- 50
- 100
- 250

Sort

- Standard (Relevance)
- Author A-Ö
- Author Ö-A
- Title A-Ö
- Title Ö-A
- Publication type A-Ö
- Publication type Ö-A
- Issued (Oldest first)
- Issued (Newest first)
- Created (Oldest first)
- Created (Newest first)
- Last updated (Oldest first)
- Last updated (Newest first)
- Disputation date (earliest first)
- Disputation date (latest first)

- Standard (Relevance)
- Author A-Ö
- Author Ö-A
- Title A-Ö
- Title Ö-A
- Publication type A-Ö
- Publication type Ö-A
- Issued (Oldest first)
- Issued (Newest first)
- Created (Oldest first)
- Created (Newest first)
- Last updated (Oldest first)
- Last updated (Newest first)
- Disputation date (earliest first)
- Disputation date (latest first)

Select

The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.

1. Asratian, Armen S. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_0_j_idt1268",{id:"formSmash:items:resultList:0:j_idt1268",widgetVar:"widget_formSmash_items_resultList_0_j_idt1268",onLabel:"Asratian, Armen S. ",offLabel:"Asratian, Armen S. ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_0_j_idt1271",{id:"formSmash:items:resultList:0:j_idt1271",widgetVar:"widget_formSmash_items_resultList_0_j_idt1271",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Department of Mathematics, Linköping University, SE-581 83 Linköping, Sweden.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:0:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Casselgren, Carl JohanUmeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:0:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); On interval edge colorings of (a,b)-biregular bipartitie graphs2006In: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 307, no 15, p. 1951-1956Article in journal (Refereed)2. Casselgren, Carl Johan PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_1_j_idt1268",{id:"formSmash:items:resultList:1:j_idt1268",widgetVar:"widget_formSmash_items_resultList_1_j_idt1268",onLabel:"Casselgren, Carl Johan ",offLabel:"Casselgren, Carl Johan ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:1:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:1:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); On avoiding some families of arrays2012In: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 312, no 5, p. 963-972Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_1_j_idt1306_0_j_idt1307",{id:"formSmash:items:resultList:1:j_idt1306:0:j_idt1307",widgetVar:"widget_formSmash_items_resultList_1_j_idt1306_0_j_idt1307",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); An

*n*×*n*array*A*with entries from {1,…,*n*} is*avoidable*if there is an*n*×*n*Latin square*L*such that no cell in*L*contains a symbol that occurs in the corresponding cell in*A*. We show that the problem of determining whether an array that contains at most two entries per cell is avoidable is*NP*-complete, even in the case when the array has entries from only two distinct symbols. Assuming that*P*≠*NP*, this disproves a conjecture by Öhman. Furthermore, we present several new families of avoidable arrays. In particular, every single entry array (arrays where each cell contains at most one symbol) of order*n*≥2*k*with entries from at most*k*distinct symbols and where each symbol occurs in at most*n*−2 cells is avoidable, and every single entry array of order*n*, where each of the symbols 1,…,*n*occurs in at most cells, is avoidable. Additionally, if*k*≥2, then every single entry array of order at least*n*≥4, where at most*k*rows contain non-empty cells and where each symbol occurs in at most*n*−*k*+1 cells, is avoidable.PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:1:j_idt1306:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 3. Casselgren, Carl Johan PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_2_j_idt1268",{id:"formSmash:items:resultList:2:j_idt1268",widgetVar:"widget_formSmash_items_resultList_2_j_idt1268",onLabel:"Casselgren, Carl Johan ",offLabel:"Casselgren, Carl Johan ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:2:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:2:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Vertex coloring complete multipartite graphs from random lists of size 22011In: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 311, no 13, p. 1150-1157Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_2_j_idt1306_0_j_idt1307",{id:"formSmash:items:resultList:2:j_idt1306:0:j_idt1307",widgetVar:"widget_formSmash_items_resultList_2_j_idt1306_0_j_idt1307",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Let

*K*_{s×m}be the complete multipartite graph with*s*parts and*m*vertices in each part. Assign to each vertex*v*of*K*_{s×m}a list*L*(*v*) of colors, by choosing each list uniformly at random from all 2-subsets of a color set*C*of size*σ*(*m*). In this paper we determine, for all fixed*s*and growing*m*, the asymptotic probability of the existence of a proper coloring*φ*, such that*φ*(*v*)∈*L*(*v*) for all*v*∈*V*(*K*_{s×m}). We show that this property exhibits a sharp threshold at*σ*(*m*)=2(*s*−1)*m*.PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:2:j_idt1306:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 4. Casselgren, Carl Johan et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_3_j_idt1271",{id:"formSmash:items:resultList:3:j_idt1271",widgetVar:"widget_formSmash_items_resultList_3_j_idt1271",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:3:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Häggkvist, RolandUmeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:3:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Completing partial Latin squares with one filled row, column and symbol2013In: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 313, no 9, p. 1011-1017Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_3_j_idt1306_0_j_idt1307",{id:"formSmash:items:resultList:3:j_idt1306:0:j_idt1307",widgetVar:"widget_formSmash_items_resultList_3_j_idt1306_0_j_idt1307",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Let P be an n x n partial Latin square every non-empty cell of which lies in a fixed row r, a fixed column c or contains a fixed symbols. Assume further that s is the symbol of cell (r, c) in P. We prove that P is completable to a Latin square if n >= 8 and n is divisible by 4, or n <= 7 and n is not an element of {3, 4, 5}. Moreover, we present a polynomial algorithm for the completion of such a partial Latin square. (C) 2013 Elsevier B.V. All rights reserved.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:3:j_idt1306:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 5. Cutler, Jonathan PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_4_j_idt1268",{id:"formSmash:items:resultList:4:j_idt1268",widgetVar:"widget_formSmash_items_resultList_4_j_idt1268",onLabel:"Cutler, Jonathan ",offLabel:"Cutler, Jonathan ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_4_j_idt1271",{id:"formSmash:items:resultList:4:j_idt1271",widgetVar:"widget_formSmash_items_resultList_4_j_idt1271",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Umeå University, Faculty of Science and Technology, Department of mathematics. Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152, USA.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:4:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Montagh, BalazsPrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:4:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Unavoidable subgraphs of colored graphs2008In: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 308, no 19, p. 4396-4413Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_4_j_idt1306_0_j_idt1307",{id:"formSmash:items:resultList:4:j_idt1306:0:j_idt1307",widgetVar:"widget_formSmash_items_resultList_4_j_idt1306_0_j_idt1307",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); A natural generalization of graph Ramsey theory is the study of unavoidable sub-graphs in large colored graphs. In this paper. we find a minimal family of unavoidable graphs in two-edge-colored graphs. Namely, for a positive even integer k, let y(k) be the family of two-edge-colored graphs on k vertices such that one of the colors forms either two disjoint K-k/2's or simply one K-k/2. Bollobas conjectured that for all k and epsilon > 0, there exists an n(k, epsilon) such that if n >= n(k, epsilon) then every two-edge-coloring of K-n, in which the density of each color is at least epsilon, contains a member of this family. We solve this conjecture and present a series of results bounding it (k, s) for different ranges of epsilon. In particular, if epsilon is sufficiently close to 1/2, the gap between out upper and lower bounds for n(k, epsilon) is smaller than those for the classical Ramsey number R(k, k).

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:4:j_idt1306:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 6. Fleischner, Herbert et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_5_j_idt1271",{id:"formSmash:items:resultList:5:j_idt1271",widgetVar:"widget_formSmash_items_resultList_5_j_idt1271",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:5:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Häggkvist, RolandUmeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:5:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Circuit double covers in special types of cubic graphs2009In: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 309, no 18, p. 5724-5728Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_5_j_idt1306_0_j_idt1307",{id:"formSmash:items:resultList:5:j_idt1306:0:j_idt1307",widgetVar:"widget_formSmash_items_resultList_5_j_idt1306_0_j_idt1307",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Suppose that a 2-connected cubic graph

*G*of order*n*has a circuit*C*of length at least*n*−4 such that*G*−*V*(*C*) is connected. We show that*G*has a circuit double cover containing a prescribed set of circuits which satisfy certain conditions. It follows that hypohamiltonian cubic graphs (i.e., non-hamiltonian cubic graphs*G*such that*G*−*v*is hamiltonian for every*v*∈*V*(*G*)) have strong circuit double covers.PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:5:j_idt1306:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 7. Fleischner, Herbert PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_6_j_idt1268",{id:"formSmash:items:resultList:6:j_idt1268",widgetVar:"widget_formSmash_items_resultList_6_j_idt1268",onLabel:"Fleischner, Herbert ",offLabel:"Fleischner, Herbert ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_6_j_idt1271",{id:"formSmash:items:resultList:6:j_idt1271",widgetVar:"widget_formSmash_items_resultList_6_j_idt1271",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Institute for Information Systems, Technical University of Vienna, Wien, Austria.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:6:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Häggkvist, RolandUmeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:6:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Cycle double covers containing certain circuits in cubic graphs having special structures2015In: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 338, no 10, p. 1750-1754Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_6_j_idt1306_0_j_idt1307",{id:"formSmash:items:resultList:6:j_idt1306:0:j_idt1307",widgetVar:"widget_formSmash_items_resultList_6_j_idt1306_0_j_idt1307",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Our point of departure is Fleischner and Haggkvist (2014, Theorem 2). We first generalize this theorem. Then we apply it to cubic graphs whose vertex set can be decomposed into two classes, one class inducing a circuit and the other class inducing a (subdivision of a) caterpillar. (C) 2014 Elsevier B.V. All rights reserved.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:6:j_idt1306:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 8. Häggkvist, Roland PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_7_j_idt1268",{id:"formSmash:items:resultList:7:j_idt1268",widgetVar:"widget_formSmash_items_resultList_7_j_idt1268",onLabel:"Häggkvist, Roland ",offLabel:"Häggkvist, Roland ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_7_j_idt1271",{id:"formSmash:items:resultList:7:j_idt1271",widgetVar:"widget_formSmash_items_resultList_7_j_idt1271",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:7:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Markström, KlasUmeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:7:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Cycle double covers and spanning minors II2006In: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 306, no 8-9, p. 762-778Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_7_j_idt1306_0_j_idt1307",{id:"formSmash:items:resultList:7:j_idt1306:0:j_idt1307",widgetVar:"widget_formSmash_items_resultList_7_j_idt1306_0_j_idt1307",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); In this paper we continue our investigations from [R. Häggkvist, K. Markström, Cycle double covers and spanning minors, Technical Report 07, Department of Mathematics, Umeå University, Sweden, 2001, J. Combin. Theory, Ser. B, to appear] regarding spanning subgraphs which imply the existence of cycle double covers. We prove that if a cubic graph

*G*has a spanning subgraph isomorphic to a subdivision of a bridgeless cubic graph on at most 10 vertices then*G*has a CDC. A notable result is thus that a cubic graph with a spanning Petersen minor has a CDC, a result also obtained by Goddyn [L. Goddyn, Cycle covers of graphs, Ph.D. Thesis, University of Waterloo, 1988].PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:7:j_idt1306:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 9. Hägglund, Jonas PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_8_j_idt1268",{id:"formSmash:items:resultList:8:j_idt1268",widgetVar:"widget_formSmash_items_resultList_8_j_idt1268",onLabel:"Hägglund, Jonas ",offLabel:"Hägglund, Jonas ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_8_j_idt1271",{id:"formSmash:items:resultList:8:j_idt1271",widgetVar:"widget_formSmash_items_resultList_8_j_idt1271",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:8:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Markström, KlasUmeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:8:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); On stable cycles and cycle double covers of graphs with large circumference2012In: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 312, no 17, p. 2540-2544Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_8_j_idt1306_0_j_idt1307",{id:"formSmash:items:resultList:8:j_idt1306:0:j_idt1307",widgetVar:"widget_formSmash_items_resultList_8_j_idt1306_0_j_idt1307",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); A cycle C in a graph is called

*stable*if there exists no other cycle D in the same graph such that V(C)⊆V(D). In this paper, we study stable cycles in snarks and we show that if a cubic graph G has a cycle of length at least |V(G)|−9 then it has a cycle double cover. We also give a construction for an infinite snark family with stable cycles of constant length and answer a question by Kochol by giving examples of cyclically 5-edge connected snarks with stable cycles.PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:8:j_idt1306:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 10. Lundow, Per-Håkan PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_9_j_idt1268",{id:"formSmash:items:resultList:9:j_idt1268",widgetVar:"widget_formSmash_items_resultList_9_j_idt1268",onLabel:"Lundow, Per-Håkan ",offLabel:"Lundow, Per-Håkan ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Umeå University, Faculty of Science and Technology, Department of mathematics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:9:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:9:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Compression of transfer matrices2001In: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 231, no 1-3, p. 321-329Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_9_j_idt1306_0_j_idt1307",{id:"formSmash:items:resultList:9:j_idt1306:0:j_idt1307",widgetVar:"widget_formSmash_items_resultList_9_j_idt1306_0_j_idt1307",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We present a method for reducing the size of transfer matrices by exploiting symmetry. For example, the transfer matrix for enumeration of matchings in the graph C-4 x C-4 x P-n can be reduced from order 65536 to 402 simply due to the 384 automorphisms of C-4 x C-4. The matrix for enumeration of perfect matchings can be still further reduced to order 93, all in a straightforward and mechanical way. As an application we report an improved upper bound for the three-dimensional dimer problem. (C) 2001 Elsevier Science B.V. All rights reserved.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:9:j_idt1306:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 11. Markström, Klas PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_10_j_idt1268",{id:"formSmash:items:resultList:10:j_idt1268",widgetVar:"widget_formSmash_items_resultList_10_j_idt1268",onLabel:"Markström, Klas ",offLabel:"Markström, Klas ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:10:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:10:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Even cycle decompositions of 4-regular graphs and line graphs2012In: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 312, no 17, p. 2676-2681Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_10_j_idt1306_0_j_idt1307",{id:"formSmash:items:resultList:10:j_idt1306:0:j_idt1307",widgetVar:"widget_formSmash_items_resultList_10_j_idt1306_0_j_idt1307",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); An even cycle decomposition of a graph is a partition of its edge into even cycles. We first give some results on the existence of even cycle decomposition in general 4-regular graphs, showing that K 5 is not the only graph in this class without such a decomposition. Motivated by connections to the cycle double cover conjecture we go on to consider even cycle decompositions of line graphs of 2-connected cubic graphs. We conjecture that in this class even cycle decompositions always exists and prove the conjecture for cubic graphs with oddness at most 2. We also discuss even cycle double covers of cubic graphs.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:10:j_idt1306:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 12. Markström, Klas PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_11_j_idt1268",{id:"formSmash:items:resultList:11:j_idt1268",widgetVar:"widget_formSmash_items_resultList_11_j_idt1268",onLabel:"Markström, Klas ",offLabel:"Markström, Klas ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:11:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:11:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Extremal hypergraphs and bounds for the Turan density of the 4-uniform K-52009In: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 309, no 16, p. 5231-5234Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_11_j_idt1306_0_j_idt1307",{id:"formSmash:items:resultList:11:j_idt1306:0:j_idt1307",widgetVar:"widget_formSmash_items_resultList_11_j_idt1306_0_j_idt1307",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); In this paper we find, for n <= 16, the maximum number of edges in a 4-uniform hypergraph which does not have the complete 4-uniform hypergraph on five vertices, K-5(4), as a subgraph. Equivalently, we find all optimal (n, n-4, n-5) covering designs for n <= 16. Using these results we find a new upper bound for the Turin density of K-5(4). pi(K-5(4)) <= 1753/2380 = 0.73655.... Finally we make some notes on the structure of the extremal 4-graphs for this problem and the conjectured extremal family. (C) 2009 Published by Elsevier B.V.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:11:j_idt1306:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 13. Öhman, Lars-Daniel PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_12_j_idt1268",{id:"formSmash:items:resultList:12:j_idt1268",widgetVar:"widget_formSmash_items_resultList_12_j_idt1268",onLabel:"Öhman, Lars-Daniel ",offLabel:"Öhman, Lars-Daniel ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:12:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:12:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); On the intricacy of avoiding multiple-entry arrays2012In: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 312, no 20, p. 3030-3036Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_12_j_idt1306_0_j_idt1307",{id:"formSmash:items:resultList:12:j_idt1306:0:j_idt1307",widgetVar:"widget_formSmash_items_resultList_12_j_idt1306_0_j_idt1307",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Let A be any n x n array on the symbols vertical bar n vertical bar = {1, . . . , n}, with at most in symbols in each cell. An n x n Latin square L on the symbols till is said to avoid A if no entry in L is present in the corresponding cell of A, and A is said to be avoidable if such a Latin square L exists. The intricacy of this problem is defined to be the minimum number of arrays into which A must be split in order to ensure that each part is avoidable. We present lower and upper bounds for the intricacy, and conjecture that the lower bound is in fact the correct answer. (C) 2012 Elsevier B.V. All rights reserved.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:12:j_idt1306:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500});

CiteExportLink to result list
http://umu.diva-portal.org/smash/resultList.jsf?query=&language=en&searchType=SIMPLE&noOfRows=50&sortOrder=author_sort_asc&sortOrder2=title_sort_asc&onlyFullText=false&sf=all&aq=%5B%5B%7B%22journalId%22%3A%227428%22%7D%5D%5D&aqe=%5B%5D&aq2=%5B%5B%5D%5D&af=%5B%5D $(function(){PrimeFaces.cw("InputTextarea","widget_formSmash_lower_j_idt1586_recordPermLink",{id:"formSmash:lower:j_idt1586:recordPermLink",widgetVar:"widget_formSmash_lower_j_idt1586_recordPermLink",autoResize:true});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_lower_j_idt1586_j_idt1588",{id:"formSmash:lower:j_idt1586:j_idt1588",widgetVar:"widget_formSmash_lower_j_idt1586_j_idt1588",target:"formSmash:lower:j_idt1586:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

Permanent link

Cite

Citation styleapa ieee modern-language-association-8th-edition vancouver Other style $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_lower_j_idt1604",{id:"formSmash:lower:j_idt1604",widgetVar:"widget_formSmash_lower_j_idt1604",behaviors:{change:function(ext) {PrimeFaces.ab({s:"formSmash:lower:j_idt1604",e:"change",f:"formSmash",p:"formSmash:lower:j_idt1604",u:"formSmash:lower:otherStyle"},ext);}}});});

- apa
- ieee
- modern-language-association-8th-edition
- vancouver
- Other style

Languagede-DE en-GB en-US fi-FI nn-NO nn-NB sv-SE Other locale $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_lower_j_idt1615",{id:"formSmash:lower:j_idt1615",widgetVar:"widget_formSmash_lower_j_idt1615",behaviors:{change:function(ext) {PrimeFaces.ab({s:"formSmash:lower:j_idt1615",e:"change",f:"formSmash",p:"formSmash:lower:j_idt1615",u:"formSmash:lower:otherLanguage"},ext);}}});});

- de-DE
- en-GB
- en-US
- fi-FI
- nn-NO
- nn-NB
- sv-SE
- Other locale

Output formathtml text asciidoc rtf $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_lower_j_idt1625",{id:"formSmash:lower:j_idt1625",widgetVar:"widget_formSmash_lower_j_idt1625"});});

- html
- text
- asciidoc
- rtf