default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 290
Volume 290, Number 1, January 2005
- Frédérique Bassino
, Julien Clément, Cyril Nicaud:
The standard factorization of Lyndon words: an average point of view. 1-25 - Robert E. Jamison, Henry Martyn Mulder:
Constant tolerance intersection graphs of subtrees of a tree. 27-46 - Qaiser Mushtaq, Tariq Maqsood:
Homomorphic images of Delta (2, 3, 11). 47-59 - Nándor Sieben, Elaina Deabay:
Polyomino weak achievement games on 3-dimensional rectangular boards. 61-78
- Robin Chapman:
A probabilistic proof of the Andrews-Gordon identities. 79-84 - Yaojun Chen, Yunqing Zhang, Kemin Zhang:
The Ramsey numbers of paths versus wheels. 85-87 - Matthew Fayers:
Multiple-elimination knockout tournaments with the fixed-win property. 89-97 - Jianxiang Li:
A new degree condition for graphs to have [a, b]-factor. 99-103 - Dingjun Lou, Akira Saito, Lihua Teng:
A note on internally disjoint alternating paths in bipartite graphs. 105-108
Volume 290, Number 2/3, February 2005
- Dan Archdeacon, Marisa Debowsky:
A characterization of projective-planar signed graphs. 109-116 - Manoj Changat, Henry Martyn Mulder, Gerard Sierksma:
Convexities related to path properties on graphs. 117-131 - Gary Chartrand, Ladislav Nebesky, Ping Zhang:
On hamiltonian colorings of graphs. 133-143 - Mei-Ju Chen, David Kuo, Jing-Ho Yan:
The bandwidth sum of join and composition of graphs. 145-163 - David J. Grynkiewicz:
On four color monochromatic sets with nondecreasing diameter. 165-171 - Frank Harary, Desh Ranjan:
Identity orientation of complete bipartite graphs. 173-182 - Hervé Kerivin, Ali Ridha Mahjoub:
On survivable network polyhedra. 183-210 - Hao Li, Jinlong Shu:
The partition of a strong tournament. 211-220 - Horst Martini, Valeriu Soltan:
Antipodality properties of finite sets in Euclidean space. 221-228 - Michael S. Roddy, Bernd S. W. Schröder:
Isotone relations revisited. 229-248 - B. P. Tan:
On the kings and kings-of-kings in semicomplete multipartite digraphs. 249-258 - Yasuo Teranishi:
The number of spanning forests of a graph. 259-267
- Alexei N. Glebov, Alexandr V. Kostochka, Vladimir A. Tashkinov:
Smaller planar triangle-free graphs that are not 3-list-colorable. 269-274 - H. L. Abbott, Donovan R. Hare:
The set of values of b for which there exist block designs with b blocks. 275-282 - Yan Liu:
Characterizations of maximum matching graphs of certain types. 283-289 - Lorenzo Traldi:
Parallel connections and coloured Tutte polynomials. 291-299
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-08 20:37 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:
