643 search results - page 69 / 129 » Supereulerian planar graphs |
168
click to vote
CCCG
2010
15 years 7 months ago
2010
Three types of geometric structure--grid triangulations, rectangular subdivisions, and orthogonal polyhedra-can each be described combinatorially by a regular labeling: an assignm...
140
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of generating all ideals of a poset. It is a long standing open problem, whether or not the ideals of any poset can be generated in constant amortized time...
155
click to vote
TAMC
2009
Springer
16 years 26 days ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
146
click to vote
COMBINATORICS
2002
15 years 6 months ago
2002
We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns. If such a matrix is ...
166
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
A k-frugal colouring of a graph G is a proper colouring of the vertices of G such that no colour appears more than k times in the neighbourhood of a vertex. This type of colouring...