default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 263
Volume 263, Number 1-3, February 2003
- A. Benkouar, Yannis Manoussakis, Rachid Saad:
The number of 2-edge-colored complete graphs with unique hamiltonian alternating cycle. 1-10 - Dumitru Busneag:
On extensions of pseudo-valuations on Hilbert algebras. 11-24 - Gary Chartrand, David Erwin
, Garry L. Johns, Ping Zhang:
Boundary vertices in graphs. 25-34 - Timothy Y. Chow:
Symplectic matroids, independent sets, and signed graphs. 35-45 - William C. Coffman, S. Louis Hakimi, Edward F. Schmeichel:
Bounds for the chromatic number of graphs with partial information. 47-59 - Robert G. Donnelly, Scott J. Lewis, Robert Pervine:
Constructions of representations of o(2n+1, C) that imply Molev and Reiner-Stanton lattices are strongly Sperner. 61-79 - T. Aaron Gulliver, Masaaki Harada, Jon-Lark Kim:
Construction of new extremal self-dual codes. 81-91 - Michael A. Henning:
Total domination excellent trees. 93-104 - Fred B. Holt:
Maximal nonrevisiting paths in simple polytopes. 105-128 - Frank K. Hwang, J. S. Lee, Yu-Chi Liu, Uriel G. Rothblum:
Sortability of vector partitions. 129-142 - Gholamreza B. Khosrovshahi, Behruz Tayfeh-Rezaie:
Root cases of large sets of t-designs. 143-155 - Sandi Klavzar, Alenka Lipovec:
Partial cubes as subdivision graphs and as generalized Petersen graphs. 157-165 - Yong Hah Lee:
Rough isometry and energy finite solutions of the Schro"dinger operator on graphs. 167-177 - Vadim E. Levit, Eugen Mandrescu:
On alpha+-stable Ko"nig-Egerváry graphs. 179-190 - Sheng-Chyang Liaw, Zhishi Pan, Xuding Zhu:
Construction of Kn-minor free graphs with given circular chromatic number. 191-206 - Terry A. McKee:
Dualizing chordal graphs. 207-219 - Terry A. McKee:
Restricted circular-arc graphs and clique cycles. 221-231 - Gelasio Salazar:
Small meshes of curves and their role in the analysis of optimal meshes. 233-246 - Wolfgang Steiner:
Generalized de Bruijn digraphs and the distribution of patterns in ?-expansions. 247-268 - Dragic Bankovic:
Distance in Post algebras. 269-274 - Sylvie Corteel, Carla D. Savage:
Anti-Lecture Hall Compositions. 275-280 - M. H. Eggar:
A tournament problem. 281-288 - Hailong Liu, Liang Sun:
The bondage and connectivity of a graph. 289-293 - Sonoko Moriyama, Fumihiko Takeuchi:
Incremental construction properties in dimension two--shellability, extendable shellability and vertex decomposability. 295-296 - Dieter Rautenbach, Lutz Volkmann:
Extremal subgraphs with respect to vertex degree bounds. 297-303 - Iwao Sato:
Decomposition formulas of zeta functions of graphs and digraphs. 305-309 - Friedrich Wehrung:
Direct decompositions of non-algebraic complete lattices. 311-321 - Jinjiang Yuan, Qin Wang:
Partition the vertices of a graph into induced matchings. 323-329 - Yue Zhao:
On the edge-reconstruction of graphs embedded in surfaces IV. 331-338 - Guofei Zhou:
A note on graphs of class I. 339-345
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 2026-03-21 23:18 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:
