default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 169
Volume 169, Numbers 1-3, May 1997
- Mao-cheng Cai:
Connected [k, k + 1]-factors of graphs. 1-16 - G. F. Clements:
The cubical poset is additive. 17-28 - Karen L. Collins, Lucia B. Krompart:
The number of Hamiltonian paths in a rectangular grid. 29-38 - Feng Ming Dong
, Khee Meng Koh:
On graphs in which any pair of colour classes but one induces a tree. 39-54 - Tuvi Etzion:
Optimal constant weight codes over Zk and generalized designs. 55-82 - Jerrold W. Grossman:
Dominating sets whose closed stars form spanning trees. 83-94 - Vladimir P. Korzhik:
A tighter bounding interval for the 1-chromatic number of a surface. 95-120 - David Kuo, Gerard J. Chang, Y. H. Harris Kwong:
Cordial labeling of mKn. 121-131 - Xin Liu:
Lower bounds of length of longest cycles in graphs involving neighborhood unions. 133-144 - Sergey Vasil'evich Sevast'janov, Wojciech Banaszczyk:
To the Steinitz lemma in coordinate form. 145-152 - Andries E. Brouwer, Henry Martyn Mulder:
The vertex connectivity of a {0, 2}-graph equals its degree. 153-155 - Aaron Abrams:
The kth upper chromatic number of the line. 157-162 - Dragic Bankovic:
General reproductive solutions of Postian equations. 163-168 - Claude Berge, Jean-Luc Fouquet:
On the optimal transversals of the odd cycles. 169-175 - Oleg V. Borodin:
A new proof of Grünbaum's 3 color theorem. 177-183 - Iliya G. Bouyukliev:
New bounds for the minimum length of quaternary linear codes of dimension five. 185-192 - Gunnar Brinkmann, Eckhard Steffen:
3- and 4-critical graphs of small even order. 193-197 - Richard A. Brualdi, J. A. Dias da Silva:
A retract characterization of posets with the fixed-point property. 199-203 - Kathie Cameron:
Coloured matchings in bipartite graphs. 205-209 - Beifang Chen:
Parametric Möbius inversion formulas. 211-215 - D. de Caen:
A lower bound on the probability of a union. 217-220 - Hortensia Galeana-Sánchez:
A characterization of normal fraternally orientable perfect graphs. 221-225 - Xavier Gourdon, Helmut Prodinger:
A generating function approach to random subgraphs of the n-cycle. 227-232 - Jerrold R. Griggs, Yan-Chyuan Lin:
The maximum sum of degrees above a threshold in planar graphs. 233-243 - Vladimir Gurvich, Leonid Khachiyan:
On the frequency of the most frequently occurring variable in dual monotone DNFs. 245-248 - Xin Liu, B. Wei:
A generalization of Bondy's and Fan's sufficient conditions for Hamiltonian graphs. 249-255 - Anthony J. Macula:
Two applications of separating systems to nonadaptive procedures. 257-262 - Ken Ono:
Odd values of the partition function. 263-268 - Søren Riis:
Bootstrapping the primitive recursive functions by only 27 colors. 269-272 - Ladislav Stacho:
A sufficient condition guaranteeing large cycles in graphs. 273-277 - Xueqing Tang, Adi Ben-Israel:
Two consequences of Minkowski's 2n theorem. 279-282 - Ioan Tomescu:
On the number of trees having k edges in common with a graph of bounded degrees. 283-286 - Bridget S. Webb:
Orbits of infinite block designs. 287-292 - Xuerong Yong, Talip Acenjian:
The numbers of spanning trees of the cubic cycle CN3 and the quadruple cycle CN4. 293-298
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-11-23 19:43 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:
