default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 154
Volume 154, Numbers 1-3, June 1996
- Mireille Bousquet-Mélou:
A method for the enumeration of various classes of column-convex polygons. 1-25 - Jason I. Brown
, Stephen Watson:
The number of complements of a topology on n points is at least 2n (except for some special cases). 27-39 - K. H. Chew:
Total chromatic number of regular graphs of odd order and high degree. 41-51 - Peter J. Grabner, Robert F. Tichy, Uwe T. Zimmermann:
Inequalities for the gamma function with applications to permanents. Discret. Math. 154(1-3): 53-62 (1996) - Andreas J. Guelzow:
Representation of finite nilpotent squags. 63-76 - Pavol Gvozdjak, Jaroslav Nesetril:
High girth and extendability. 77-84 - Jo Heath, Anthony J. W. Hilton:
At most k-to-1 mappings between graphs, II. 85-102 - W. Cary Huffman:
The equivalence of two cyclic objects on pq elements. 103-127 - Klaus Jansen:
A rainbow about T-colorings for complete graphs. 129-139 - Devadatta M. Kulkarni:
Counting of paths and coefficients of the Hilbert polynomial of a determinantal ideal. 141-151 - Taojun Lu:
The enumeration of trees with and without given limbs. 153-165 - Peter Maschlanka, Lutz Volkmann:
Independence number in n-extendable graphs. 167-178 - Sean McGuinness:
On bounding the chromatic number of L-graphs. 179-187 - Fred R. McMorris, Henry Martyn Mulder:
Subpath acyclic digraphs. 189-201 - Daniel Q. Naiman, Henry P. Wynn:
Independence number and the complexity of families of sets. 203-216 - John L. Pfaltz:
Closure lattices. 217-236 - Ngo Dac Tan:
Cubic (m, n)-metacirculant graphs which are not Cayley graphs. 237-244 - Cun-Quan Zhang:
Nowhere-zero 4-flows and cycle double covers. 245-253 - J. Orestes Cerdeira, Paulo Bárcia:
Ordered matroids and regular independence systems. 255-261 - Paul Erdös, András Gyárfás, Tomasz Luczak:
Graphs in which each C4 spans K4. 263-268 - Frank Gerth:
Some probabilities for eigenvalues of matrices with entries in finite fields. 269-275 - Stefan Hougardy:
Even pairs and the strong perfect graph conjecture. 277-278 - Henry Jacob, Henry Meyniel:
About quasi-kernels in a digraph. 279-280 - Khee Meng Koh, B. P. Tan:
Number of 4-kings in bipartite tournaments with no 3-kings. 281-287 - Khee Meng Koh, Chung-Piaw Teo:
Chromaticity of series-parallel graphs. 289-295 - Xueliang Li, Heping Zhang:
A solution to Gutman's problem on the characteristic polynomial of a bipartite graph. 297-300 - Nicolas Macris, J. V. Pulé:
An alternative formula for the number of Euler trails for a class of digraphs. 301-305 - Roy Meshulam:
On products of projections. 307-310 - Hans Jürgen Prömel, Angelika Steger:
Counting H-free graphs. 311-315 - U. Schulte:
Constructing trees in bipartite graphs. 317-320 - Michal Tkác:
On the shortness exponent of 1-tough, maximal planar graphs. 321-328
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 22:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
