Sciweavers

Share
DAM
2010
105views more  DAM 2010»
9 years 4 months ago
An iterative approach to graph irregularity strength
An assignment of positive integer weights to the edges of a simple graph G is called irregular if the weighted degrees of the vertices are all different. The irregularity strength,...
Michael Ferrara, Ronald J. Gould, Michal Karonski,...
DAM
2010
104views more  DAM 2010»
9 years 5 months ago
Sorting with networks of data structures
We consider the problem of sorting a permutation using a network of data structures as introduced by Knuth and Tarjan. In general the model as considered previously was restricted...
Therese C. Biedl, Alexander Golynski, Angèl...
DAM
2010
103views more  DAM 2010»
9 years 7 months ago
Dynamic list coloring of bipartite graphs
A dynamic coloring of a graph is a proper coloring of its vertices such that every vertex of degree more than one has at least two neighbors with distinct colors. The least number...
Louis Esperet
DAM
2010
57views more  DAM 2010»
9 years 7 months ago
Enumeration of polyominoes inscribed in a rectangle
Alain Goupil, Hugo Cloutier, Fathallah Nouboud
DAM
2010
111views more  DAM 2010»
9 years 7 months ago
Covering line graphs with equivalence relations
An equivalence graph is a disjoint union of cliques, and the equivalence number eq(G) of a graph G is the minimum number of equivalence subgraphs needed to cover the edges of G. W...
Louis Esperet, John Gimbel, Andrew King
DAM
2010
86views more  DAM 2010»
9 years 7 months ago
The clique operator on circular-arc graphs
Min Chih Lin, Francisco J. Soulignac, Jayme Luiz S...
DAM
2010
81views more  DAM 2010»
9 years 7 months ago
The k-in-a-tree problem for graphs of girth at least k
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...
W. Liu, Nicolas Trotignon
DAM
2010
95views more  DAM 2010»
9 years 7 months ago
Excessive factorizations of bipartite multigraphs
Let G be a multigraph. We say that G is 1-extendable if every edge of G is contained in a 1-factor. Suppose G is 1-extendable. An excessive factorization of G is a set F = {F1, F2...
David Cariolaro, Romeo Rizzi
books