Covering the edges of digraphs in D(3,3)D(3,3) and D(4,4)D(4,4) with directed cuts Fulltext Access 6 Pages 2012
Sufficient conditions for the existence of spanning colored trees in edge-colored graphs Fulltext Access 6 Pages 2012
On the minimum number of edges of two-connected graphs with given diameter Fulltext Access 6 Pages 2012
A particular Hamiltonian cycle on middle levels in the De Bruijn digraph Fulltext Access 6 Pages 2012
Singular matrices with restricted rows in vector spaces over finite fields Fulltext Access 6 Pages 2012
Kirchhoff index in line, subdivision and total graphs of a regular graph Fulltext Access 6 Pages 2012
RETRACTED: Pancyclic graphs and degree sum and neighborhood union involving distance two Fulltext Access 6 Pages 2012
Multiple factor Nordhaus–Gaddum type results for domination and total domination Fulltext Access 6 Pages 2012
A strengthened analysis of an algorithm for Dominating Set in planar graphs Fulltext Access 6 Pages 2012
Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words Fulltext Access 6 Pages 2012
Computing the permanental polynomials of bipartite graphs by Pfaffian orientation Fulltext Access 6 Pages 2012
On graphs which can or cannot induce Chinese Postman games with a non-empty core Fulltext Access 6 Pages 2012
Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width Fulltext Access 6 Pages 2012
A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems Fulltext Access 7 Pages 2012
Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits Fulltext Access 7 Pages 2012
On the restricted matching extension of graphs on the torus and the Klein bottle Fulltext Access 7 Pages 2012
On the parameterized complexity of coloring graphs in the absence of a linear forest Fulltext Access 7 Pages 2012
Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number Fulltext Access 7 Pages 2012
On dynamic monopolies of graphs: The average and strict majority thresholds Fulltext Access 7 Pages 2012
The substring inclusion constraint longest common subsequence problem can be solved in quadratic time Fulltext Access 7 Pages 2012
The rank of edge connection matrices and the dimension of algebras of invariant tensors Fulltext Access 7 Pages 2012