Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 260
Volume 260, Number 1-3, January 2003
- Kiyoshi Ando, Yoshimi Egawa:
Maximum number of edges in a critically k-connected graph. 1-25 - Abraham Berman, Xiao-Dong Zhang:
Bipartite density of cubic graphs. 27-35 - Ernest J. Cockayne, Michael A. Henning, Christina M. Mynhardt
:
Vertices contained in all or in no minimum total dominating set of a tree. 37-44 - Muktar E. Elzobi, Zbigniew Lonc:
Partitioning Boolean lattices into antichains. 45-55 - Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann:
Remarks on the bondage number of planar graphs. 57-67 - Yuqiang Guan, Kenneth L. Williams:
Profile minimization on triangulated triangles. 69-76 - Teresa W. Haynes, Michael A. Henning, Peter J. Slater:
Strong equality of domination parameters in trees. 77-87 - Sergey Kitaev:
Multi-avoidance of generalised patterns. 89-100 - Luo Yuan, Wende Chen, Fang-Wei Fu:
A new kind of geometric structures determining the chain good weight hierarchies. 101-117 - Marcelo Muniz Silva Alves, Sueli I. Rodrigues Costa:
Labelings of Lee and Hamming spaces. 119-136 - G. Sethuraman, P. Selvaraju:
Decompositions of complete graphs and complete bipartite graphs into isomorphic supersubdivision graphs. 137-149 - Shiying Wang, Jianxiu Hao:
The extreme set condition of a graph. 151-161 - Jianqiang Wu, Jingzhong Mao, Deying Li:
New types of integral sum graphs. 163-176 - Daniel Berend, Nimrod Kriger:
On some questions of Razpet regarding binomial coefficients. 177-182 - Tom Bohman, Ryan R. Martin:
A note on G-intersecting families. 183-188 - Dietmar Cieslik:
The Steiner ratio of several discrete metric spaces. 189-196 - Miranca Fischermann, Dieter Rautenbach, Lutz Volkmann:
Maximum graphs with a unique minimum dominating set. 197-203 - Peter Frankl, Norihide Tokushige:
The game of n-times nim. 205-209 - Judith Keijsper:
A Vizing-type theorem for matching forests. 211-216 - Jianxiang Li:
On neighborhood condition for graphs to have [a, b]-factors. 217-221 - Qiaoliang Li:
On weights in duadic abelian codes. 223-230 - Terry A. McKee:
Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs. 231-238 - Jixiang Meng:
Optimally super-edge-connected transitive graphs. 239-248 - Pavel Podbrdský:
A bijective proof of an identity for noncrossing graphs. 249-253 - Yasuo Teranishi:
The Hoffman number of a graph. 255-265 - Wenwen Tong, Huiling Li:
Solvable block transitive automorphism groups of 2-(v, 5, 1) designs. 267-273 - Svetlana Topalova:
Classification of Hadamard matrices of order 44 with automorphisms of order 7. 275-283 - Miaolin Ye:
Size of k-uniform hypergraph with diameter d. 285-293 - Jian-Hua Yin, Jiong-Sheng Li:
An extremal problem on potentially Kr, s-graphic sequences. 295-305 - Shengyuan Zhang, Jian Zhu:
An improved product construction for large sets of Kirkman triple systems. 307-313 - Andrey A. Dobrynin, Leonid S. Melnikov, Artem V. Pyatkin:
On 4-chromatic edge-critical regular graphs of high connectivity. 315-319 - Rögnvaldur G. Möller:
Erratum to "Descendants in highly arc transitive digraphs" [Discrete Mathematics 247 (2002) 147-157]. 321- - Dale Peterson, Douglas R. Woodall:
Erratum to "Edge-choosability in line-perfect multigraphs" [Discrete Mathematics 202 (1999) 191]. 323-326
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-07-16 20:52 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:
