Sciweavers

DM
2006
60views more  DM 2006»
13 years 11 months ago
On cycles through specified vertices
For a set X of vertices of a graph fulfilling local connectedness conditions the existence of a cycle containing X is proved. AMS classification: 05C38, 05C45, 05C35
Tobias Gerlach, Frank Göring, Jochen Harant, ...
DM
2006
59views more  DM 2006»
13 years 11 months ago
Factors of the Gaussian coefficients
Abstract. We present some simple observations on factors of the qbinomial coefficients, the q-Catalan numbers, and the q-multinomial coefficients. Writing the Gaussian coefficient ...
William Y. C. Chen, Qing-Hu Hou
DM
2006
61views more  DM 2006»
13 years 11 months ago
On geodetic sets formed by boundary vertices
José Cáceres, M. Carmen Hernando, Me...
DM
2006
78views more  DM 2006»
13 years 11 months ago
On polynomial digraphs
Let (x, y) be a bivariate polynomial with complex coefficients. The zeroes of (x, y) are given a combinatorial structure by considering them as arcs of a directed graph G(). This p...
Josep M. Brunat, Antonio Montes
DM
2006
52views more  DM 2006»
13 years 11 months ago
Self-clique Helly circular-arc graphs
Flavia Bonomo
DM
2006
95views more  DM 2006»
13 years 11 months ago
Extending a matroid by a cocircuit
Our main result describes how to extend a matroid so that its ground set is a modular hyperplane of the larger matroid. This result yields a new way to view Dowling lattices and ne...
Joseph E. Bonin
DM
2006
63views more  DM 2006»
13 years 11 months ago
Safe separators for treewidth
Hans L. Bodlaender, Arie M. C. A. Koster
DM
2006
87views more  DM 2006»
13 years 11 months ago
A vertex incremental approach for maintaining chordality
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...
Anne Berry, Pinar Heggernes, Yngve Villanger
DM
2006
61views more  DM 2006»
13 years 11 months ago
A degree bound on decomposable trees
Dominique Barth, Hervé Fournier