Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 196
Volume 196, Numbers 1-3, February 1999
- Krishnaswami Alladi:
A variation on a theme of Sylvester - a smoother road to Göllnitz's (Big) theorem. 1-11 - Jørgen Bang-Jensen
:
Linkages in locally semicomplete digraphs and quasi-transitive digraphs. 13-27 - Jan Brousek, Zdenek Ryjácek, Odile Favaron:
Forbidden subgraphs, hamiltonicity and closure in claw-free graphs. 29-50 - Owen D. Byer:
Two path extremal graphs and an application to a Ramsey-type problem. 51-64 - John S. Caughman IV:
The Terwilliger algebras of bipartite P- and Q-polynomial schemes. 65-95 - C. T. Cheng, Lenore Cowen:
On the local distinguishing numbers of cycles. 97-108 - Thomas Dinski, Xuding Zhu:
A bound for the game chromatic number of graphs. 109-115 - Steven T. Dougherty, T. Aaron Gulliver, Masaaki Harada:
Optimal ternary formally self-dual codes. 117-135 - Tung-Shan Fu:
Erdös-Ko-Rado-type results over Jq(n, d), Hq(n, d) and their designs. 137-151 - Albert Gräf:
Distance graphs and the T-coloring problem. 153-166 - Zhiquan Hu:
A generalization of fan's condition and forbidden subgraph conditions for hamiltonicity. 167-175 - Stanislav Jendrol':
Triangles with restricted degrees of their boundary vertices in plane triangulations. 177-196 - Arnold Knopfmacher:
On the degrees of irreducible factors of polynomials over a finite field. 197-206 - Wojciech Kordecki, Tomasz Luczak:
On the connectivity of random subsets of projective spaces. 207-217 - Sheng-Chyang Liaw, Gerard J. Chang:
Rabin numbers of Butterfly networks. 219-227 - Václav Linek, Zhike Jiang:
Hooked k-extended Skolem sequences. 229-238 - B. S. Panda:
The forbidden subgraph characterization of directed vertex graphs. 239-256 - Mario-Osvin Pavcevic, Edward Spence:
Some new symmetric designs with lambda = 10 having an automorphism of order 5. 257-266 - Juan A. Rodríguez-Velázáuez, José Luis Andres Yebra:
Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods. 267-275 - Yoshimi Kashiwagi, Isao Kikumasa:
Indecomposability of cyclic codes. 277-280 - Zhenqi Yang:
On F-Hamiltonian graphs. 281-286 - Zhizheng Zhang:
A binomial identity related to Calkin's. 287-289 - Zhizheng Zhang:
A kind of binomial identity. 291-298
a service of 
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-06-18 21:22 CEST 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:
