default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 127
Volume 127, Numbers 1-3, March 1994
- Preface. 1
- Gakuho Abe:
Unsolved problems on magic squares. 3-13 - Michael O. Albertson, Debra L. Boutin:
Lower bounds for constant degree independent sets. 15-21 - Robert E. L. Aldred, Derek A. Holton, Zang Ke Min:
A degree characterisation of pancyclicity. 23-29 - Noga Alon:
Probabilistic methods in coloring and decomposition problems. 31-46 - Mehdi Behzad, Ebadollah S. Mahmoodian:
Eccentric sequences and triangle sequences of block designs. 47-56 - Jose M. Bernaldez:
On cyclically K-complementary graphs. 57-62 - Peter J. Cameron
:
Two-graphs and trees. 63-74 - Luis D. Carrillo:
Hamiltonian-connected self-complementary graphs. 75-93 - David P. Day, Ortrud R. Oellermann, Henda C. Swart:
On the l-connectivity of a diagraph. 95-104 - Caterina De Simone, Michel Deza, Monique Laurent:
Collapsing and lifting for the cut cone. 105-130 - Chai-Ling Deng, Chong-Keang Lim:
A class of clique-closed graphs. 131-137 - Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau:
Extremal problems and generalized degrees. 139-152 - Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
A local density condition for triangles. 153-161 - Josep Fàbrega, Miguel Angel Fiol:
Extraconnectivity of graphs with large girth. 163-170 - I. A. Faradzev:
Association schemes on the set of antiflags of a projective plane. 171-179 - Hung-Lin Fu, Kuo-Ching Huang:
On prime labellings. 181-186 - Zoltán Füredi:
Intersecting designs from linear programming and graphs of diameter two. 187-207 - Jerrold R. Griggs, Daniel J. Kleitman:
Independence and the Havel-Hakimi residue. 209-212 - Pavol Hell, Xingxing Yu, Huishan Zhou:
Independence ratios of graph powers. 213-220 - A. V. Ivanov:
Two families of strongly regular graphs with the 4-vertex condition. 221-242 - Khee Meng Koh, Kee L. Teo:
Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles. 243-258 - K. Nomura:
An application of intersection diagrams of high rank. 259-264 - Barry L. Piazza, Richard D. Ringeisen, S. Stueckle:
Subthrackleable graphs and four cycles. 265-276 - Michael D. Plummer:
Extending matchings in graphs: A survey. 277-292 - Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani:
Minimal acyclic forbidden minors for the family of graphs with bounded path-width. 293-304 - Morimasa Tsuchiya:
On antichain intersection numbers, total clique covers and regular graphs. 305-318 - Zsolt Tuza:
Largest size and union of Helly families. 319-327
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 2024-11-22 19:45 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:
