2005-04-20
On a generalization of Chva'tal's condition giving new hamiltonian degree sequences.
159-165
2005
292
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.12.002
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm292.html#StachoS05
2005-04-21
<i>n, n</i>)-graphs.
167-185
2005
292
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.10.022
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm292.html#WojdaWZ05
2005-04-20
Bartholdi zeta functions of line graphs and middle graphs of graph coverings.
143-157
2005
292
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.11.006
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm292.html#MizunoS05
2005-04-20
The incidence coloring conjecture for graphs of maximum degree 3.
131-141
2005
292
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2005.02.003
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm292.html#Maydanskiy05
2005-04-20
Circular chromatic numbers of some distance graphs.
119-130
2005
292
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2005.02.004
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm292.html#LinLS05
2005-04-20
Disjoint paths in arborescences.
187-191
2005
292
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.12.005
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm292.html#ColussiCZ05
2005-04-20
Acute triangles in 4-connected maximal plane graphs.
95-106
2005
292
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.09.008
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm292.html#KawarabayashiNOW05
2005-04-20
Embedding partial G-designs where G is a 4-cycle with a pendant edge.
83-93
2005
292
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.11.005
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm292.html#Jenkins05
2005-04-20
On survivable network polyhedra.
183-210
2005
290
Discrete Mathematics
2/3
http://dx.doi.org/10.1016/j.disc.2004.08.017
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm290.html#KerivinM05
2005-04-20
Antipodality properties of finite sets in Euclidean space.
221-228
2005
290
Discrete Mathematics
2/3
http://dx.doi.org/10.1016/j.disc.2004.09.009
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm290.html#MartiniS05
2005-04-20
The number of spanning forests of a graph.
259-267
2005
290
Discrete Mathematics
2/3
http://dx.doi.org/10.1016/j.disc.2004.10.014
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm290.html#Teranishi05
2005-04-20
On hamiltonian colorings of graphs.
133-143
2005
290
Discrete Mathematics
2/3
http://dx.doi.org/10.1016/j.disc.2004.10.009
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm290.html#ChartrandNZ05
2005-04-20
Isotone relations revisited.
229-248
2005
290
Discrete Mathematics
2/3
http://dx.doi.org/10.1016/j.disc.2004.10.012
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm290.html#RoddyS05
2005-04-20
The partition of a strong tournament.
211-220
2005
290
Discrete Mathematics
2/3
http://dx.doi.org/10.1016/j.disc.2004.10.011
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm290.html#LiS05
2005-04-20
A characterization of projective-planar signed graphs.
109-116
2005
290
Discrete Mathematics
2/3
http://dx.doi.org/10.1016/j.disc.2004.09.007
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm290.html#ArchdeaconD05
2005-04-20
On four color monochromatic sets with nondecreasing diameter.
165-171
2005
290
Discrete Mathematics
2/3
http://dx.doi.org/10.1016/j.disc.2004.10.010
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm290.html#Grynkiewicz05
2005-04-20
Convexities related to path properties on graphs.
117-131
2005
290
Discrete Mathematics
2/3
http://dx.doi.org/10.1016/j.disc.2003.07.014
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm290.html#ChangatMS05
2005-04-20
Identity orientation of complete bipartite graphs.
173-182
2005
290
Discrete Mathematics
2/3
http://dx.doi.org/10.1016/j.disc.2004.07.017
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm290.html#HararyR05
2005-04-20
The bandwidth sum of join and composition of graphs.
145-163
2005
290
Discrete Mathematics
2/3
http://dx.doi.org/10.1016/j.disc.2004.10.008
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm290.html#ChenKY05
2005-04-20
On the kings and kings-of-kings in semicomplete multipartite digraphs.
249-258
2005
290
Discrete Mathematics
2/3
http://dx.doi.org/10.1016/j.disc.2004.10.013
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm290.html#Tan05
2005-10-14
Ramsey degrees of bipartite graphs: A primitive recursive proof.
111-119
2005
293
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.08.035
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm293.html#FouchePS05
2005-07-25
<i>p</i>elements, where p=5 (mod 8).
11-17
2005
293
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.08.025
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm293.html#AndersonE05
2005-07-25
Preface.
1-
2005
293
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2005.02.001
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm293.html#Woodall05
2005-07-25
Independence number of iterated line digraphs.
185-193
2005
293
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.08.030
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm293.html#Lichiardopol05
2005-07-25
Graphs with the Erdo"s-Ko-Rado property.
165-176
2005
293
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.08.028
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm293.html#HolroydT05
2005-07-25
Girth 5 graphs from relative difference sets.
177-184
2005
293
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.08.029
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm293.html#Jorgensen05
2005-07-25
Basic perfect graphs and their extensions.
291-311
2005
293
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.08.033
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm293.html#ZverovichZ05
2005-07-25
On the Steiner, geodetic and hull numbers of graphs.
139-154
2005
293
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.08.039
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm293.html#HernandoJMPS05
2005-07-25
Generalized subgraph-restricted matchings in graphs.
129-138
2005
293
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.08.027
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm293.html#GoddardHHL05
2005-07-25
<i>Z</i>-cyclic whist tournament designs.
19-28
2005
293
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.08.019
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm293.html#AndersonF05
2005-07-25
De Bruijn and Kautz digraphs of a rooted tree.
219-236
2005
293
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.08.040
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm293.html#RuizM05
2005-07-26
<sub>pq</sub>with as few segments as possible.
29-59
2005
293
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.08.020
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm293.html#AndersonP05
2005-07-25
Efficient reconstruction of partitions.
205-211
2005
293
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.08.037
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm293.html#MaynardS05
2005-07-25
On new identities for Bell's polynomials.
5-10
2005
293
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.08.023
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm293.html#AbbasB05
2005-07-25
Research problems from the 19th British Combinatorial Conference.
313-320
2005
293
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2005.02.006
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm293.html#Cameron05c
2005-09-19
The seven classes of 5×6 triple arrays.
213-218
2005
293
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.08.032
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm293.html#PhillipsPW05
2005-07-25
Guest editor listing.
3-
2005
293
Discrete Mathematics
1-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm293.html#X05
2005-07-25
Compression and Erdo"s-Ko-Rado graphs.
155-164
2005
293
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.08.041
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm293.html#HolroydST05
2005-07-25
The Baillon-Simons theorems.
251-261
2005
293
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.08.034
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm293.html#Tsaur05
2005-07-25
Trivially noncontractible edges in a contraction critically 5-connected graph.
61-72
2005
293
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.08.021
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm293.html#Ando05
2005-07-25
Covering radius for sets of permutations.
91-109
2005
293
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.08.024
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm293.html#CameronW05
2005-07-25
Efficient enumeration of sensed planar maps.
263-289
2005
293
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.08.036
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm293.html#Walsh05
2005-07-25
Balanced colourings of strongly regular graphs.
73-90
2005
293
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.08.022
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm293.html#Bailey05
2005-07-25
Extendability of quaternary linear codes.
195-203
2005
293
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.08.031
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm293.html#Maruta05
2005-07-25
On eulerian and regular perfect path double covers of graphs.
237-250
2005
293
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.08.038
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm293.html#SeyffarthW05
2005-07-26
On the size of the minimum critical set of a Latin square.
121-127
2005
293
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.08.026
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm293.html#GhandehariHM05
2005-07-25
Moufang-like conditions for generalized quadrangles and classification of all finite quasi-transitive generalized quadrangles.
203-217
2005
294
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/j.disc.2004.04.047
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#ThasM05
2005-07-25
Sparse graph certificates for mixed connectivity.
285-290
2005
294
Discrete Mathematics
3
http://dx.doi.org/10.1016/j.disc.2004.11.011
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#Fulop05
2005-07-25
Altitude of regular graphs with girth at least five.
241-257
2005
294
Discrete Mathematics
3
http://dx.doi.org/10.1016/j.disc.2005.02.007
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#MynhardtBCFH05
2005-07-25
The stabilizer of the Adelaide oval.
161-173
2005
294
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/j.disc.2004.04.045
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#PayneT05
2005-07-25
Finite Geometries, First Irsee Conference, 16-21 February, 2003.
1-
2005
294
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/j.disc.2005.01.001
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#BlokhuisHJT05
2005-07-25
Guest editors.
3-
2005
294
Discrete Mathematics
1-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#X05a
2005-07-25
<i>n</i>=6.
291-296
2005
294
Discrete Mathematics
3
http://dx.doi.org/10.1016/j.disc.2004.11.010
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#HabibN05
2005-07-25
4-regular claw-free IM-extendable graphs.
303-309
2005
294
Discrete Mathematics
3
http://dx.doi.org/10.1016/j.disc.2004.11.009
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#QinJ05
2005-07-25
Ovals and hyperovals in nets.
53-74
2005
294
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/j.disc.2004.04.036
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#ColbournDM05
2005-07-25
Generalized quadrangles and regularity.
25-42
2005
294
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/j.disc.2004.04.034
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#Brown05
2005-07-25
On edge domination numbers of graphs.
311-316
2005
294
Discrete Mathematics
3
http://dx.doi.org/10.1016/j.disc.2004.11.008
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#Xu05
2005-07-25
Two rank six geometries for the Higman-Sims sporadic group.
123-132
2005
294
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/j.disc.2004.04.041
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#Leemans05
2005-07-25
On the dimension of trees.
279-283
2005
294
Discrete Mathematics
3
http://dx.doi.org/10.1016/j.disc.2004.11.013
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#BrighamCDZ05
2005-07-25
<i>H</i><i>n, q</i><sup>2</sup>).
75-81
2005
294
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/j.disc.2004.04.037
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#BeuleM05
2005-07-25
Good eggs and Veronese varieties.
119-122
2005
294
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/j.disc.2004.04.040
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#LavrauwL05
2005-10-14
Maximal arc partitions of designs.
5-11
2005
294
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/j.disc.2004.04.031
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#Al-KenaniM05
2005-07-25
<i>k, n</i>)-arcs.
223-224
2005
294
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/j.disc.2004.04.049
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#Voloch05
2005-07-25
Problems by the wayside.
175-201
2005
294
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/j.disc.2004.04.046
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#Shult05
2005-07-25
On two-transitive parabolic ovals.
13-19
2005
294
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/j.disc.2004.04.032
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#BonisoliR05
2005-07-25
<i>q</i><i>q</i>).
109-118
2005
294
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/j.disc.2004.04.039
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#KaeyM05
2005-07-25
Gap-free compositions and gap-free samples of geometric random variables.
225-239
2005
294
Discrete Mathematics
3
http://dx.doi.org/10.1016/j.disc.2005.02.008
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#HitczenkoK05
2005-07-25
Affine designs and linear orthogonal arrays.
219-222
2005
294
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/j.disc.2004.04.048
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#Tonchev05
2005-07-25
The 3-choosability of plane graphs of girth 4.
297-301
2005
294
Discrete Mathematics
3
http://dx.doi.org/10.1016/j.disc.2004.10.023
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#LamSS05
2005-07-25
<i>Q</i><i>q</i><i>q</i>even.
133-138
2005
294
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/j.disc.2004.04.042
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#LuyckxT05
2005-07-25
Distance-j ovoids and related structures in generalized polygons.
147-160
2005
294
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/j.disc.2004.04.044
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#OfferM05
2005-07-25
The Ramsey number of paths with respect to wheels.
275-277
2005
294
Discrete Mathematics
3
http://dx.doi.org/10.1016/j.disc.2004.10.024
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#BaskoroS05
2005-07-25
On non-squashing partitions.
259-274
2005
294
Discrete Mathematics
3
http://dx.doi.org/10.1016/j.disc.2004.11.014
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#SloaneS05
2005-07-25
Combinatorial aspects of jump codes.
43-51
2005
294
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/j.disc.2004.04.035
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#CharnesB05
2005-07-25
<i>Q</i><i>n, q</i><i>q</i>an odd prime.
83-107
2005
294
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/j.disc.2004.04.038
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#BeuleS05
2005-07-25
On quasi-3 designs and spin models.
21-24
2005
294
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/j.disc.2004.04.033
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#BrackenM05
2005-07-25
<i>n</i>, 3)-arcs in PG(2, 13).
139-145
2005
294
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/j.disc.2004.04.043
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm294.html#MarcuginiMP05
2005-07-25
STS-graphs of perfect codes mod kernel.
31-47
2005
295
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.12.008
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm295.html#DejterD05
2005-07-25
Completion of Laplacian integral graphs via edge addition.
75-90
2005
295
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.12.010
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm295.html#Kirkland05
2005-07-25
Some new hereditary classes where graph coloring remains NP-hard.
197-202
2005
295
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2005.03.003
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm295.html#Schindl05
2005-07-25
Bigraphs/digraphs of Ferrers dimension 2 and asteroidal triple of edges.
191-195
2005
295
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.11.012
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm295.html#DasS05
2005-07-25
A lower bound for the CO-irredundance number of a graph.
49-62
2005
295
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.12.009
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm295.html#Finbow05
2005-07-25
On critical trees labeled with a condition at distance two.
173-189
2005
295
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2005.02.011
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm295.html#Troxell05
2005-07-25
On problems and conjectures on adjointly equivalent graphs.
203-212
2005
295
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2005.02.009
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm295.html#ZhaoLL05
2005-07-25
Generalizations of lattices via non-deterministic operators.
107-141
2005
295
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.08.043
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm295.html#MartinezGGC05
2005-07-25
The formal series Witt transform.
143-160
2005
295
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2005.03.004
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm295.html#Moree05
2005-07-25
On average lower independence and domination numbers in graphs.
1-11
2005
295
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.12.006
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm295.html#BlidiaCM05
2005-10-04
The orientation number of two complete graphs with linkages.
91-106
2005
295
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2005.02.010
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm295.html#KohN05
2005-07-25
Cyclotomic R-orthomorphisms of finite fields.
161-171
2005
295
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.12.011
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm295.html#NiederreiterW05
2005-07-25
On extensions, linear extensions, upsets and downsets of ordered sets.
13-30
2005
295
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2004.12.007
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm295.html#CorreaS05
2005-07-25
Elementary proofs of some q-identities of Jackson and Andrews-Jain.
63-74
2005
295
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2005.03.001
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm295.html#Guo05
2005-07-25
On the Burkard-Hammer condition for hamiltonian split graphs.
59-72
2005
296
Discrete Mathematics
1
http://dx.doi.org/10.1016/j.disc.2005.03.008
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm296.html#TanH05
2005-07-25
<i><sup>xyz</sup></i><i>xyz</i>=-++.
263-270
2005
296
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/j.disc.2005.04.002
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm296.html#WuZZ05
2005-07-25
The cover pebbling number of graphs.
15-23
2005
296
Discrete Mathematics
1
http://dx.doi.org/10.1016/j.disc.2005.03.009
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm296.html#CrullCFHPST05
2005-07-25
Multigraph decomposition into stars and into multistars.
235-244
2005
296
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/j.disc.2005.03.012
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm296.html#PrieslerT05
2005-07-25
<i><sub>n</sub></i><i><sub>n</sub></i>-algebra of fractions.
143-165
2005
296
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/j.disc.2005.02.012
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm296.html#BusneagC05
2005-07-25
Chromatic sums of 2-edge-connected maps on the plane.
211-223
2005
296
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/j.disc.2005.02.014
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm296.html#LiL05
2005-07-25
Edge-disjoint spanners in Cartesian products of graphs.
167-186
2005
296
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/j.disc.2005.04.004
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm296.html#FertinLSS05
2005-07-25
On directed zero-divisor graphs of finite rings.
73-86
2005
296
Discrete Mathematics
1
http://dx.doi.org/10.1016/j.disc.2005.03.006
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm296.html#Wu05
2005-07-25
On 2-edge-connected [a, b]-factors of graphs with Ore-type condition.
225-234
2005
296
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/j.disc.2005.01.004
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm296.html#Matsuda05
2005-07-25
On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems.
25-41
2005
296
Discrete Mathematics
1
http://dx.doi.org/10.1016/j.disc.2004.08.042
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm296.html#GolumbicKV05
2005-07-25
<i>PG</i><i>q</i><i>H(q)</i>.
129-142
2005
296
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/j.disc.2005.03.010
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm296.html#BonoliP05
2005-07-25
Generalization of matching extensions in graphs-combinatorial interpretation of orthogonal and q-orthogonal polynomials.
199-209
2005
296
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/j.disc.2005.02.013
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm296.html#KyriakoussisV05
2005-07-25
Supersolvable LL-lattices of binary trees.
1-13
2005
296
Discrete Mathematics
1
http://dx.doi.org/10.1016/j.disc.2005.03.005
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm296.html#BiagioliC05
2005-07-25
Multicyclic treelike reflexive graphs.
43-57
2005
296
Discrete Mathematics
1
http://dx.doi.org/10.1016/j.disc.2005.03.007
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm296.html#RadosavljevicR05
2005-07-25
Covering radii are not matroid invariants.
117-120
2005
296
Discrete Mathematics
1
http://dx.doi.org/10.1016/j.disc.2005.03.002
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm296.html#BritzR05
2005-07-25
A finiteness theorem for primal extensions.
103-116
2005
296
Discrete Mathematics
1
http://dx.doi.org/10.1016/j.disc.2005.01.002
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm296.html#Zverovich05
2005-07-25
<i>q</i>-Dixon identity.
259-261
2005
296
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/j.disc.2005.04.006
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm296.html#GuoZ05
2005-07-25
A bound on the total size of a cut cover.
121-128
2005
296
Discrete Mathematics
1
http://dx.doi.org/10.1016/j.disc.2005.04.003
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm296.html#KundgenS05
2005-07-25
<i>OSTS</i><i>n</i><i>OGDD</i><i><sup>n</sup></i><i>n</i><i>k</i>+1.
87-102
2005
296
Discrete Mathematics
1
http://dx.doi.org/10.1016/j.disc.2004.12.012
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm296.html#Zhang05
2005-07-25
Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees.
187-197
2005
296
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/j.disc.2005.04.001
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm296.html#HongZ05
2005-07-25
On certain morphisms of sequential dynamical systems.
245-257
2005
296
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/j.disc.2005.03.013
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm296.html#Reidys05
2005-07-25
Consecutive positive detectable matrices and group testing for consecutive positives.
369-381
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00282-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#MullerJ04
2005-07-25
<i><sub>v</sub></i><i>k</i>-circuits with one chord.
287-315
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00276-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#KangZZ04
2005-07-25
Generalized cover-free families.
463-477
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00287-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#StinsonW04
2005-07-25
<i>P</i><sub>4</sub>-designs into 5-cycle systems.
407-421
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00284-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#QuattrocchiM04
2005-07-25
Existence of incomplete resolvable minimum coverings of pairs by triples.
437-462
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00285-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#ShenSD04
2005-07-25
Further results on optimal optical orthogonal codes with weight 4.
135-151
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00264-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#ChangY04
2005-07-25
<i>Z</i><i>Z</i>-cyclic generalized whist tournaments.
215-223
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00271-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#FinizioT04
2005-07-25
Existence of APAV(q, k) with q a prime power =5(mod 8) and k=1(mod 4).
153-161
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00265-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#ChenCW04
2006-04-26
Splitting systems and separating systems.
355-368
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00280-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#LingLR04
2005-07-25
Hamilton decompositions of complete graphs with a 3-factor leave.
337-344
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00281-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#LeachR04
2005-07-25
<i>v</i><i>w</i><sup>star</sup>}, 1)-PBDs.
61-105
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00262-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#BennettCGG04
2005-07-25
Balanced incomplete block designs with block size 9: part II.
5-32
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00260-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#AbelBG04
2005-07-25
A survey on resolvable group divisible designs with block size four.
225-245
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00274-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#GeL04a
2005-07-25
Preface.
1-2
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00258-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#BennettCWY04
2005-07-25
Cyclic Hamiltonian cycle systems of the complete graph.
107-119
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00267-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#BurattiF04
2005-07-25
<i>Z</i>-cyclic whist designs.
203-213
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00270-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#Finizio04
2005-07-25
HGDDs with block size four.
267-276
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00273-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#GeW04
2005-07-25
Perfect hexagon triple systems.
325-335
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00278-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#KucukcifciL04
2005-07-25
<i>v</i>).
121-133
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00263-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#CaoT04
2005-07-25
New combinatorial designs and their applications to authentication codes and secret sharing schemes.
383-405
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00283-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#OgataKSS04
2005-07-25
On large sets of Kirkman triple systems and 3-wise balanced design.
345-354
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00279-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#Lei04
2005-07-25
On the spectrum of r-self-orthogonal Latin squares.
479-498
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00288-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#XuC04
2005-07-25
Existence of optimal strong partially balanced designs with block size five.
173-190
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00268-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#Du04a
2005-07-25
Some properties of matrices with signed null spaces.
423-435
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00286-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#ShaoR04
2005-07-25
<sub>n</sub><i><sup>t</sup></i>.
33-60
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00261-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#AndersonP04
2005-07-25
Guest Editors.
3-
2004
279
Discrete Mathematics
1-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#X04
2005-07-25
Some new orthogonal designs in orders 32 and 40.
317-324
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00277-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#KharaghaniT04
2005-07-25
<sub>2</sub><i>m</i>.
277-286
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00275-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#HollmannX04
2005-07-25
<i>n</i>, 4, 2)-OOC of small orders.
163-172
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00266-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#ChuC04
2005-07-25
Combinatorial constructions for optimal supersaturated designs.
191-202
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00269-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#FangGLQ04
2005-07-25
<i><sup>u</sup><sub>m</sub></i>1.
247-265
2004
279
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00272-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm279.html#GeR04
2005-07-25
Construction of one-regular graphs of valency 4 and 6.
195-207
2004
278
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00252-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm278.html#OhH04
2005-07-25
Cycles within specified distance from each vertex.
219-226
2004
278
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2003.05.004
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm278.html#SaitoY04
2005-07-25
Chromatic classes of 2-connected (n, n+4)-graphs with at least four triangles.
209-218
2004
278
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2003.05.003
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm278.html#PengL04
2005-07-25
Signed total domination in graphs.
109-125
2004
278
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2003.06.002
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm278.html#Henning04a
2005-07-25
<i><sub>n</sub></i>with 4-cycles.
175-193
2004
278
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00251-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm278.html#KucukcifciLR04
2005-07-29
Guest Editors.
3-
2003
272
Discrete Mathematics
1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm272.html#X03
2005-07-25
<i>k</i><i>k</i>]-factors in graphs.
127-138
2004
278
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00248-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm278.html#HoffmannV04
2005-07-25
Graph covers using t-colourable vertex sets.
61-80
2004
278
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00246-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm278.html#GravierJKK04
2005-07-25
Roman domination in graphs.
11-22
2004
278
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2003.06.004
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm278.html#CockayneDHH04
2005-07-25
Snarks and flow-snarks constructed from coloring-snarks.
165-174
2004
278
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00250-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm278.html#Kochol04
2005-07-25
Recovering trees from well-separated multi-state characters.
151-164
2004
278
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00249-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm278.html#Huber04
2005-07-25
Iterated colorings of graphs.
81-108
2004
278
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00247-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm278.html#HedetniemiHMPT04
2005-07-25
The Kadison-Singer problem in discrepancy theory.
227-239
2004
278
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00253-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm278.html#Weaver04
2005-07-25
Almost self-complementary circulant graphs.
23-44
2004
278
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2003.05.002
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm278.html#DobsonS04
2005-07-25
Bipartite graphs with small third Laplacian eigenvalue.
241-253
2004
278
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00255-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm278.html#Zhang04
2005-07-25
Induced matchings in intersection graphs.
1-9
2004
278
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2003.05.001
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm278.html#Cameron04
2005-07-25
Transitivity of local complementation and switching on graphs.
45-60
2004
278
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2003.04.001
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm278.html#EhrenfeuchtHR04
2005-07-25
Generator polynomials of characteristic ideal of maximal periodic arrays over Galois rings.
139-149
2004
278
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2003.06.001
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm278.html#HuP04
2005-07-25
Minus domination number in k-partite graphs.
295-300
2004
277
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2003.07.008
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm277.html#KangKS04
2005-07-25
<i>C</i><sub>3</sub>-structure of the tournaments.
29-43
2004
277
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00244-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm277.html#BoussairiILT04
2005-07-25
Erratum to "Upper bounds for domination numbers of the queen's graph": [Discrete Mathematics 242 (2002) 229-243].
321-
2004
277
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2003.11.001
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm277.html#Weakley04
2005-07-25
On maximum face-constrained coloring of plane graphs with no short face cycles.
301-307
2004
277
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2003.08.001
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm277.html#Kral04a
2005-07-25
On the structure of random unlabelled acyclic graphs.
147-170
2004
277
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00156-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm277.html#McColm04
2005-07-25
Codes and designs in Grassmannian spaces.
15-28
2004
277
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00151-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm277.html#BachocBC04
2005-07-25
On the connectivity of certain graphs of high girth.
309-319
2004
277
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2003.08.003
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm277.html#LazebnikV04
2005-07-25
Combinatorial proofs of identities of Calkin and Hirschhorn.
287-294
2004
277
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2003.07.007
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm277.html#FengZ04
2005-07-25
Sylvester's bijection between strict and odd partitions.
275-278
2004
277
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2002.02.001
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm277.html#Lascoux04
2005-07-25
On a tiling conjecture of Komlo's for 3-chromatic graphs.
171-191
2004
277
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00157-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm277.html#ShokoufandehZ04
2005-07-25
Towards classification of semigraphoids.
115-145
2004
277
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00155-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm277.html#Matus04
2005-07-25
Matching properties in domination critical graphs.
1-13
2004
277
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00243-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm277.html#AnanchuenP04
2005-07-25
Surfaces having no regular hypermaps.
241-274
2004
277
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2003.03.001
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm277.html#Wilsond04
2005-07-25
Barycentric sequences and barycentric Ramsey numbers stars.
45-56
2004
277
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00153-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm277.html#DelormeGOV04
2005-07-25
0-Centred and 0-ubiquitously graceful trees.
193-218
2004
277
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00152-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm277.html#Bussel04
2005-07-25
Typical circulant double coverings of a circulant graph.
73-85
2004
277
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00245-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm277.html#FengK04
2005-07-25
Cheeger constants of Platonic graphs.
101-113
2004
277
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00178-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm277.html#LanphierR04
2005-07-25
On the cut polyhedron.
279-285
2004
277
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2002.12.001
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm277.html#ConfortiRW04
2005-07-25
On the hardness of counting problems of complete mappings.
87-100
2004
277
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00176-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm277.html#HsiangHS04
2005-07-25
Bipartite rainbow Ramsey numbers.
57-72
2004
277
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00154-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm277.html#ErohO04
2005-07-25
<i>p</i>).
219-240
2004
277
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00158-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm277.html#VasigaS04
2005-07-29
On a conjecture of Manickam and Singhi.
259-261
2003
272
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(03)00192-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm272.html#Bhattacharya03
2005-07-29
Edge decomposition of complete tripartite graphs.
269-275
2003
272
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(03)00195-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm272.html#Edwards03
2005-07-29
Preface.
1-2
2003
272
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(03)00190-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm272.html#Harary03
2005-07-29
Subcolorings and the subchromatic number of a graph.
139-154
2003
272
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(03)00177-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm272.html#GimbelH03
2005-07-29
The asymptotic number of claw-free cubic graphs.
107-118
2003
272
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(03)00188-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm272.html#McKayPRR03
2005-07-29
Graphs with only caterpillars as spanning trees.
81-95
2003
272
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(03)00186-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm272.html#JamisonMM03
2005-07-29
On the equality of the partial Grundy and upper ochromatic numbers of graphs.
53-64
2003
272
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(03)00184-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm272.html#ErdosHLP03
2006-05-24
A connection between varieties of quasigroups and graph decompositions.
127-137
2003
272
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(03)00257-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm272.html#LindnerR03
2005-07-29
Finite homogeneous and lattice ordered effect algebras.
197-214
2003
272
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(03)00256-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm272.html#Jenca03
2005-07-29
<i>H</i>-domination in graphs.
97-105
2003
272
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(03)00187-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm272.html#KohLS03
2005-07-29
Stratification and domination in graphs.
171-185
2003
272
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(03)00078-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm272.html#ChartrandHHZ03
2005-07-29
Changing and unchanging domination: a classification.
65-79
2003
272
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(03)00185-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm272.html#HaynesH03
2005-07-29
The existence of directed BIBDs.
155-169
2003
272
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(03)00077-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm272.html#ChangF03
2005-07-29
Edge-recognizable domination numbers.
47-51
2003
272
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(03)00183-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm272.html#DuttonBG03
2005-07-29
<i>F</i>-colorings of graphs.
37-46
2003
272
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(03)00182-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm272.html#ChartrandNZ03
2005-07-29
Radius-edge-invariant and diameter-edge-invariant graphs.
119-126
2003
272
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(03)00189-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm272.html#WalikarBI03
2005-07-29
<i>t, r</i>)-regular graphs of large order.
297-300
2003
272
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(03)00200-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm272.html#JamisonJ03
2005-07-29
On the independence graph of a graph.
263-268
2003
272
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(03)00194-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm272.html#BresarZ03
2005-07-29
The generalized Borwein conjecture. II. Refined q-trinomial coefficients.
215-258
2003
272
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(03)00047-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm272.html#Warnaar03
2005-07-29
Some work towards the proof of the reconstruction conjecture.
291-296
2003
272
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(03)00198-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm272.html#GuptaMP03
2005-07-29
Multidimensional bipartite trees.
17-26
2003
272
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(03)00180-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm272.html#BeinekeP03
2005-07-29
Independence for knights on hexagon and triangle boards.
27-35
2003
272
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(03)00181-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm272.html#BodeH03
2005-07-29
Some results related to the toughness of 3-domination critical graphs.
5-15
2003
272
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(03)00179-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm272.html#AnanchuenP03
2005-07-29
Coloring the hypergraph of maximal cliques of a graph with no long path.
285-290
2003
272
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(03)00197-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm272.html#GravierHM03
2005-07-29
MGDD with block size 4 and its application to sampling designs.
277-283
2003
272
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(03)00196-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm272.html#GeWW03
2005-07-29
Nearly bipartite graphs.
187-196
2003
272
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(03)00076-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm272.html#GyoriNS03
2005-07-29
4-Colorable 6-regular toroidal graphs.
261-274
2003
273
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00242-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm273.html#YehZ03
2005-07-29
Problems and results in extremal combinatorics--I.
31-53
2003
273
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00227-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm273.html#Alon03
2005-07-29
Average running time analysis of an algorithm to calculate the size of the union of Cartesian products.
211-220
2003
273
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00239-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm273.html#SuzukiI03
2005-07-29
Extremal problems under dimension constraints.
9-21
2003
273
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00225-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm273.html#AhlswedeAK03
2005-07-29
On the orthogonal product of simplices and direct products of truncated Boolean lattices.
163-172
2003
273
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00234-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm273.html#Leck03
2005-07-29
Analysis of greedy algorithms on graphs with bounded degrees.
235-260
2003
273
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00241-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm273.html#Wormald03
2005-07-29
Further asymptotic size Ramsey results obtained via linear programming.
193-202
2003
273
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00237-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm273.html#Pikhurko03
2005-07-29
Chordal embeddings of planar graphs.
85-102
2003
273
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00230-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm273.html#BouchitteMT03
2005-07-29
Distance labeling scheme and split decomposition.
115-130
2003
273
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00232-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm273.html#GavoilleP03
2005-07-29
Geometric thickness in a grid.
221-234
2003
273
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00240-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm273.html#Wood03
2005-07-29
A note on random homomorphism from arbitrary graphs to Z.
173-181
2003
273
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00235-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm273.html#LoeblNR03
2005-07-29
Edge splitting and connectivity augmentation in directed hypergraphs.
71-84
2003
273
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00229-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm273.html#BergJJ03
2005-07-29
Guest Editors.
7-
2003
273
Discrete Mathematics
1-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm273.html#X03a
2005-07-29
Maximal antichains under dimension constraints.
23-29
2003
273
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00226-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm273.html#AhlswedeAK03a
2005-07-29
Antisymmetric flows and strong oriented coloring of planar graphs.
203-209
2003
273
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00238-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm273.html#Samal03
2005-07-29
Computing the average parallelism in trace monoids.
131-162
2003
273
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00233-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm273.html#KrobMM03
2005-07-29
Vertices of degree 6 in a contraction critically 6-connected graph.
55-69
2003
273
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00228-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm273.html#AndoKK03
2005-07-29
Channel assignment on graphs of bounded treewidth.
183-192
2003
273
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00236-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm273.html#McDiarmidR03
2005-07-29
Random strongly regular graphs?
103-114
2003
273
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00231-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm273.html#Cameron03
2005-07-29
Foreword.
1-6
2003
273
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00223-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm273.html#NesetrilNS03
2005-07-29
Tree-width, clique-minors, and eigenvalues.
281-287
2004
274
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00199-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm274.html#Hong04
2005-07-29
Homomorphisms and oriented colorings of equivalence classes of oriented graphs.
161-172
2004
274
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00086-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm274.html#KlostermeyerM04
2006-10-26
Results of Hurwitz type for three squares.
9-24
2004
274
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00079-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm274.html#CooperH04
2005-07-29
Maximal total absolute displacement of a permutation.
319-321
2004
274
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00205-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm274.html#Mitchell04
2005-07-29
On upper domination Ramsey numbers for graphs.
125-135
2004
274
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00084-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm274.html#HenningO04
2005-07-29
On maximum number of edges in a spanning eulerian subgraph.
299-302
2004
274
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00202-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm274.html#LiLM04
2005-07-29
On codes meeting the Griesmer bound.
289-297
2004
274
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00201-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm274.html#Klein04
2005-07-29
On the computation of coset leaders with high Hamming weight.
213-231
2004
274
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00090-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm274.html#Raddum04
2005-07-29
Cycles and perfect matchings.
93-108
2004
274
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00082-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm274.html#HaglundR04
2005-07-29
Tension-flow polynomials on graphs.
173-185
2004
274
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00087-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm274.html#Kochol04a
2005-07-29
On a new identity for Kloosterman sums and nonlinear system of equations over finite fields of characteristic 2.
109-124
2004
274
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00083-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm274.html#HellesethZ04
2005-07-29
<i>c</i><i>c, lambda</i><i>c</i><i>v, k, lambda</i>).
77-92
2004
274
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00081-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm274.html#GreigHS04
2005-07-29
Completeness theory for the product of finite partial algebras.
241-264
2004
274
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00091-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm274.html#Romov04
2005-07-29
Irreducible polynomials over GF(2) with prescribed coefficients.
265-279
2004
274
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00092-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm274.html#YucasM04
2005-07-29
Relations between the lower domination parameters and the chromatic number of a graph.
1-8
2004
274
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00093-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm274.html#ChellaliV04
2005-07-29
Edge-colorings of complete graphs that avoid polychromatic trees.
137-145
2004
274
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2003.09.002
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm274.html#JiangW04
2005-07-29
<i>S</i><i>v</i>).
199-212
2004
274
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00089-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm274.html#MeszkaR04
2005-07-29
Number of maximum matchings of bipartite graphs with positive surplus.
311-318
2004
274
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00204-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm274.html#LiuL04
2005-07-29
Constructions of uniform designs by using resolvable packings and coverings.
25-40
2004
274
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00100-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm274.html#FangLTY04
2005-07-29
<i>p</i><sup>3</sup>.
187-198
2004
274
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00088-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm274.html#MalnicMW04
2005-07-29
On extensions of Calkin's binomial identities.
331-342
2004
274
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00206-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm274.html#WangZ04
2005-07-29
<sup>ast</sup>posets.
323-329
2004
274
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2003.07.001
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm274.html#Reading04
2005-07-29
Weak order polytopes.
111-127
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00101-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#FioriniF04
2005-07-29
Edge coloring of graphs with small average degrees.
207-218
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00107-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#LuoZ04
2005-07-29
Kernels in pretransitive digraphs.
129-136
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00103-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#Galeana-SanchezR04b
2005-07-29
<i>x</i>+1 function.
219-236
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00125-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#MonksY04
2005-07-29
<i>P</i><sub>3</sub><i>designs</i>.
137-149
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00104-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#Gionfriddo04
2005-07-29
Interval numbers of powers of block graph.
87-96
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00098-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#ChenCW04a
2005-07-29
The chromatic uniqueness of certain complete t-partite graphs.
375-383
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2003.06.014
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#Zou04
2005-07-29
<i>q</i><i>q</i>-Stirling numbers.
67-85
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00099-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#Charalambides04
2005-07-29
On the identification problems in products of cycles.
277-288
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00111-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#Rosendahl04
2005-07-29
Minimum degree and minimum number of edge-disjoint trees.
195-205
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00108-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#SanchezM04
2005-07-29
The 10-cages and derived configurations.
265-276
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00110-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#PisanskiBMOG04
2005-07-29
Common multiples of complete graphs and a 4-cycle.
289-297
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2002.11.001
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#AdamsBM04
2005-07-29
New minimum distance bounds for linear codes over GF(5).
97-110
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00126-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#DaskalovHM04
2005-07-29
<i>n</i>-path.
367-373
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2002.10.001
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#WiermanSJG04
2005-07-29
<sub><sup>m</sup></sub><sub><sup>m</sup></sub>.
43-65
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00097-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#BetsumiyaLN04
2005-07-29
On 3-cutwidth critical graphs.
339-346
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2003.06.012
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#LinY04
2005-07-29
Mandatory representation designs MRD({4, k};v) with k=1 mod 3.
319-329
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2003.09.005
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#Ge04
2005-07-29
<i>k</i>-regular matrices.
1-15
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00095-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#AppaK04
2005-07-29
Balanced regular coverings of a signed graph and regular branched orientable surface coverings over a non-orientable surface.
177-193
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00105-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#KwakLS04
2005-07-29
A note on finite semifields and certain p-groups of class 2.
355-362
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2003.04.002
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#RoccoR04
2005-07-29
<i>m</i>-ary partition function.
347-353
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2003.06.013
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#Lu04
2005-07-29
Domination analysis of greedy heuristics for the frequency assignment problem.
331-338
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2003.05.008
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#KollerN04
2005-07-29
Semi-regular graphs of minimum independence number.
237-263
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00109-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#NelsonR04
2005-07-29
<i>m</i>-ary partitions.
17-41
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00096-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#Bakoev04
2005-07-29
Extremal connected graphs for independent domination number.
299-309
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2003.06.011
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#BrighamCV04
2005-07-29
Reducible chains of planar 1-cycle resonant graphs.
151-164
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00102-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#GuoZ04
2005-07-29
<i>N</i>-free posets.
165-175
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00106-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#Khamis04
2005-07-29
Clique-width of countable graphs: a compactness property.
127-148
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00303-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#Courcelle04
2005-07-29
A successful concept for measuring non-planarity of graphs: the crossing number.
331-352
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00317-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#Szekely04
2005-07-29
On the choice number of claw-free perfect graphs.
211-218
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00292-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#GravierM04
2005-07-29
"Réseaux réguliers" or regular graphs--Georges Brunel as a French pioneer in graph theory.
219-227
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00320-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#Gropp04
2005-07-29
Automorphism groups of k-arc transitive covers.
273-285
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00298-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#Serra04
2005-07-29
Guest Editors.
3-
2004
276
Discrete Mathematics
1-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#X04a
2005-07-29
Splitting off edges between two subsets preserving the edge-connectivity of the graph.
5-28
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00291-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#Bang-JensenJ04
2005-07-29
Local Ramsey numbers for copies of cycles.
29-42
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00309-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#Bielak04
2005-07-29
Difference graphs.
59-64
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00321-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#BorosGM04
2005-07-29
A note on computing graph closures.
327-329
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00316-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#Spinrad04
2005-07-29
3-Colorability and forbidden subgraphs. I: Characterizing pairs.
313-325
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00312-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#Randerath04
2005-07-29
Partition of a graph into cycles and degenerated cycles.
177-181
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00300-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#EnomotoL04
2005-07-29
Split orders.
249-267
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00313-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#GuenverR04
2005-07-29
Well-located graphs: a collection of well-covered ones.
201-209
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00297-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#FinbowH04
2005-07-29
Orthogonal drawings based on the stratification of planar graphs.
43-57
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00305-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#BonichonSM04
2005-07-29
On a min-max theorem on bipartite graphs.
353-361
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00318-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#Szigeti04
2005-08-01
On covers of graphs.
287-294
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00314-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#MaxovaN04
2005-07-29
Preface.
1-2
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2003.10.011
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#FouquetR04
2005-07-29
Cycles through given vertices and closures.
65-80
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00304-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#CadaFLR04
2005-07-29
Clique-width of partner-limited graphs.
363-374
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00295-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#Vanherpe04
2005-07-29
The minimum density of an identifying code in the king lattice.
95-109
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00306-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#CharonHHL04
2005-08-05
Cayley partitionable graphs and near-factorizations of finite groups.
295-311
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00293-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#Pecher04
2005-07-29
Coloring planar Toeplitz graphs and the stable set polytope.
183-200
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00315-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#Euler04
2005-07-29
<i>k</i>-matching.
375-378
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00299-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#Wojda04
2005-07-29
Packing of graphs and permutations--a survey.
379-391
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00296-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#Wozniak04
2005-07-29
<sup>-</sup>-ER-critical graphs.
111-125
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00302-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#CockayneFM04
2005-07-29
Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures.
81-94
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00311-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#CaporossiH04
2005-07-29
On the extension of a partial metric to a tree metric.
229-248
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00294-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#GuenocheLM04
2005-07-29
The lower domination parameters in inflation of graphs of radius 1.
269-272
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00310-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#KabanovV04
2005-07-29
Antisymmetric flows and edge-connectivity.
161-167
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00301-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#DeVosNR04
2005-07-29
On the rank of a matrix associated with a graph.
169-175
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00308-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#Dobrynin04
2005-07-29
Laplacian eigenvalues and fixed size multisection.
149-159
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00307-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#Delorme04
2005-07-29
<i>Z</i>-transformation graphs of perfect matchings of plane bipartite graphs.
393-404
2004
276
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00319-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm276.html#ZhangZY04
2005-08-05
Scattered subsets.
213-228
2003
267
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00616-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm267.html#MunariniS03
2005-08-05
On embedded products of Grassmannians.
153-158
2003
267
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00610-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm267.html#HavlicekZ03
2005-08-05
Truncations of inductively minimal geometries.
63-74
2003
267
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00603-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm267.html#Cara03
2005-08-05
Veronese varieties over fields with non-zero characteristic: a survey.
159-173
2003
267
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00611-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm267.html#Havlicek03
2005-08-05
A new bound on the size of the largest critical set in a Latin square.
13-21
2003
267
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00599-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm267.html#BeanM03
2005-08-05
Skewaffine spaces in the language of distance spaces.
175-180
2003
267
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00612-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm267.html#Hotje03
2005-08-05
Unitals and codes.
23-33
2003
267
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00600-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm267.html#BettenBT03
2005-08-05
Preface.
1-2
2003
267
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00597-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm267.html#BicharaGLM03
2005-08-05
On absolutely universal embeddings.
45-62
2003
267
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00602-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm267.html#BlokP03
2005-08-05
Linear representation of Buekenhout-Metz unitals.
247-252
2003
267
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00618-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm267.html#Polverino03
2005-08-05
Using a progressive withdrawal procedure to study superconnectivity in digraphs.
229-246
2003
267
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00617-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm267.html#PelayoMBF03
2005-08-05
Complete arcs arising from conics.
181-187
2003
267
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00613-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm267.html#KorchmarosS03
2005-08-05
Ovoidal linear spaces.
87-93
2003
267
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00605-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm267.html#VitoM03
2005-08-05
APN functions in odd characteristic.
95-112
2003
267
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00606-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm267.html#DobbertinMMPW03
2005-08-05
Constructing graphs with several pseudosimilar vertices or edges.
197-211
2003
267
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00615-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm267.html#Lauri03
2005-08-05
<i>v</i>).
143-151
2003
267
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00609-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm267.html#GreigR03
2005-08-05
<i>k</i>-contractible edge.
3-11
2003
267
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00598-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm267.html#AndoK03
2005-08-05
On linear morphisms of product spaces.
35-43
2003
267
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00601-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm267.html#BicharaHZ03
2005-08-05
Quasiparallelism in finite planar spaces.
127-142
2003
267
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00608-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm267.html#Freni03
2005-08-05
On automorphisms of Cayley-digraphs of abelian groups.
189-196
2003
267
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00614-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm267.html#Kovacs03
2005-08-05
Partial and semipartial geometries: an update.
75-86
2003
267
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00604-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm267.html#Clerck03
2005-08-05
On small dense arcs in Galois planes of square order.
113-125
2003
267
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00607-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm267.html#FainaG03
2005-08-05
On Macula's error-correcting pool designs.
311-314
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00034-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#Hwang03
2006-03-31
Bhaskar Rao designs with block size four.
293-298
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00031-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#GeL03a
2005-08-05
On planarity and colorability of circulant graphs.
153-169
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00685-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#Heuberger03
2005-08-05
Classification of perfect linear codes with crown poset structure.
21-30
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00679-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#AhnKKK03
2005-08-05
The Petersen graph is not 3-edge-colorable--a new proof.
325-326
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00138-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#NaserasrS03
2005-08-05
Magic twin body stars generated from chains of prismoids.
315-323
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00035-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#Mierendorff03
2005-08-05
Composite planar coverings of graphs.
207-216
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00689-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#Negami03
2005-08-05
On neighbors in geometric permutations.
327-335
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00052-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#SharirS03
2005-08-05
Planar domination graphs.
129-137
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00684-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#EschenKS03
2005-08-05
Fiber-complemented graphs II. Retractions and endomorphisms.
81-101
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00682-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#Chastand03
2006-03-31
Resolvable group divisible designs with block size four and group size six.
139-151
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00039-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#GeL03
2005-08-05
Chords of longest circuits in 3-connected graphs.
199-206
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00688-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#LiZ03
2005-08-05
The recognition problem for line bigraphs.
243-256
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00691-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#Prisner03
2005-08-05
The automorphism group of the random graph: four conjugates good, three conjugates better.
257-271
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00692-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#Truss03
2005-08-05
Generalized whist tournament designs.
1-19
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00743-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#AbelFGL03
2005-08-05
On a list-coloring problem.
303-308
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00033-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#GravierMM03
2005-08-05
An improvement of the two-line algorithm for proving q-hypergeometric identities.
273-286
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00686-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#ZhangL03
2005-08-05
A simple proof of Dixon's identity.
309-310
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00054-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#Guo03
2005-08-05
Extremal weight enumerators and ultraspherical polynomials.
103-127
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00683-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#Duursma03
2005-08-05
Normalized volumes of configurations related with root systems and complete bipartite graphs.
217-242
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00690-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#OhsugiH03
2005-08-05
Counting Mal'tsev clones on small sets.
59-80
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00681-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#BulatovI03
2005-08-05
On multiple coverings of the infinite rectangular grid with balls of constant radius.
31-48
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00744-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#Axenovich03
2006-06-27
The existence of hyper-L triple-loop networks.
287-291
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00030-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#ChenHLS03
2005-08-05
<i>F</i><sub>2</sub><i>m</i><i>m</i>.
337-341
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00036-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#ShinS03
2005-08-05
On Hamilton cycle decompositions of the tensor product of complete graphs.
49-58
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00680-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#BalakrishnanBPY03
2005-08-05
Nordhaus-Gaddum bounds for independent domination.
299-302
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00032-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#GoddardH03
2005-08-05
Finite transition matrices for permutations avoiding pairs of length four patterns.
171-183
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00042-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#KremerS03
2005-08-05
Completing the spectrum of r-orthogonal Latin squares.
343-349
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00053-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#ZhuZ03
2005-08-05
Every 3-connected distance claw-free graph is Hamilton-connected.
185-197
2003
268
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00687-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm268.html#LiS03
2005-08-05
<i>P</i><sub>2</sub>-path graphs.
13-20
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00828-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#BalbuenaF03
2005-08-05
Thresholds for families of multisets, with an application to graph pebbling.
21-34
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00745-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#BekmetjevBCH03
2005-08-05
On the minimal nonzero distance between triangular embeddings of a complete graph.
149-160
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00751-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#GrannellGKS03
2005-08-05
An infinite family of cubic one-regular graphs with unsolvable automorphism groups.
281-286
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00056-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#FengK03
2005-08-05
Small cycle cover of 2-connected cubic graphs.
295-302
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00058-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#LaiL03
2005-08-05
<sub>n</sub>.
35-43
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00748-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#CartwrightSZ03
2005-08-05
An upper bound on the sum of squares of degrees in a hypergraph.
259-263
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00130-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#Bey03
2005-08-05
Finite BL-algebras.
93-112
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00754-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#NolaL03
2005-08-05
<i>M</i><i>n</i>-extendable bipartite graphs.
1-11
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00827-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#AldredHLS03
2005-08-05
<i>r</i>.
311-314
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00060-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#Miao03
2006-03-02
Isometric embeddings of subdivided wheels in hypercubes.
287-293
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00057-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#GravierKM03
2005-08-05
Countable ultrahomogeneous antimatroids of convex dimension 2.
113-125
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00830-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#Duby03
2005-08-05
<i>K</i><sub>4</sub>-minor free graph.
303-309
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00059-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#LihWZ03
2005-08-05
<i>D</i>.
325-332
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00061-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#Willigenburg03
2005-08-05
<i>n</i>-Tokyoites' loop-line commuter problem.
81-91
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00747-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#ChenT03
2005-08-05
<i>D</i><i>r, m</i>}.
249-258
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00758-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#YuanshengL03
2005-08-05
Uniqueness of the decomposition of the rank function of a 2-polymatroid.
161-179
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00753-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#Lemos03
2005-08-05
Inherent dualisability.
219-237
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00756-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#Pitkethly03
2005-08-05
Suzuki groups and automorphisms of finite linear spaces.
181-190
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00752-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#Liu03
2005-08-05
On Cheeger inequalities of a graph.
315-323
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00127-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#Tan03
2005-08-05
<i>n</i><i>n</i>-1.
65-79
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00829-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#ChartrandEHSZ03
2005-08-05
A permutation group determined by an ordered set.
273-279
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00094-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#ClaessonGW03
2005-08-05
Idempotents for derangement numbers.
239-248
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00757-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#Schocker03
2005-08-05
On the largest eigenvalue of a tree with perfect matchings.
45-63
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00746-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#Chang03
2005-08-05
Simply connected incidence algebras.
333-355
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00128-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#AssemPRT03
2005-08-05
Labeling trees with a condition at distance two.
127-148
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00750-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#GeorgesM03
2005-08-05
Partitionable graphs arising from near-factorizations of finite groups.
191-218
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00755-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#Pecher03
2005-08-05
2-connected graphs with small 2-connected dominating sets.
265-271
2003
269
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00055-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm269.html#CaroY03
2005-08-05
Postscript: "Permutations with forbidden subsequences and a generalized Schro"der number" [Discrete Mathematics 218 (2000) 121-130].
332-333
2003
270
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00124-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm270.html#Kremer03
2005-08-05
Covering vertices of a graph by k disjoint cycles.
114-124
2003
270
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00831-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm270.html#EgawaHKW03
2005-08-05
To the Readers and... .
1-
2003
270
Discrete Mathematics
1-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm270.html#X03b
2005-08-05
Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
266-277
2003
270
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00838-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm270.html#Steinsky03
2005-08-05
<sub>r</sub><sub>s</sub><i>k</i>)-perfect graphs.
240-249
2003
270
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00836-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm270.html#RautenbachV03
2005-08-05
Subgraph trees in graph theory.
3-12
2003
270
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00161-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm270.html#McKee03
2005-08-05
Postscript: "Endomorphism spectra of graphs" [Discrete Mathematics 109 (1992) 45-57].
328-330
2003
270
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00123-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm270.html#BottcherK03
2005-08-05
Cumulants, lattice paths, and orthogonal polynomials.
176-190
2003
270
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00834-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm270.html#Lehner03
2005-08-05
New sets with large Borsuk numbers.
136-146
2003
270
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00833-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm270.html#HinrichsR03
2005-08-05
Reconstruction of infinite locally finite connected graphs.
60-97
2003
270
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00867-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm270.html#ChastandP03
2005-08-05
Rings and constructions of partial difference sets.
148-175
2003
270
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00832-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm270.html#Hou03
2005-08-05
Further results on nearly Kirkman triple systems with subsystems.
98-113
2003
270
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00749-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm270.html#DengRS03
2005-08-05
Splitting the shadow.
42-59
2003
270
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00865-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm270.html#BonnecazeCDS03
2005-08-05
Number of minimum vertex cuts in transitive graphs.
310-316
2003
270
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00133-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm270.html#MengZ03
2005-08-05
Matroids with many common bases.
192-204
2003
270
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00835-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm270.html#Lemos03a
2005-08-05
Erratum to "On a class of finite linear spaces with few lines": [Discrete Mathematics 270 (2003) 207-224].
224-225
2003
270
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00112-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm270.html#Napolitano03a
2005-08-05
<i>n</i>.
290-297
2003
270
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00129-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm270.html#Armanious03
2005-08-05
<sub>k</sub><i>C</i><sub>l</sub>-graphic sequences.
318-326
2003
270
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00137-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm270.html#YinLC03
2005-08-05
Congruences for degenerate number sequences.
278-288
2003
270
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00839-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm270.html#Young03
2005-08-05
Order shattering and Wilson's theorem.
126-135
2003
270
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00869-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm270.html#FriedlR03
2005-08-05
Bandwidth of the composition of two graphs.
298-308
2003
270
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00131-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm270.html#Kojima03
2005-08-05
Lower bounds for the cardinality of minimal blocking sets in projective spaces.
13-31
2003
270
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00863-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm270.html#Bokler03
2005-08-05
On a class of finite linear spaces with few lines.
206-223
2003
270
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00873-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm270.html#Napolitano03
2005-08-05
Upper bounds for Ramsey numbers.
250-264
2003
270
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00837-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm270.html#Shi03
2005-08-05
Homomorphisms and amalgamation.
32-41
2003
270
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00864-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm270.html#Bonato03
2005-08-05
On reorienting graphs by pushing down maximal vertices--II.
226-239
2003
270
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00160-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm270.html#Pretzel03
2005-08-05
Classification of greedy subset-sum-distinct-sequences.
271-282
2003
271
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00875-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm271.html#Korff03
2005-08-05
Chromatic equivalence classes of certain generalized polygon trees, III.
223-234
2003
271
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00874-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm271.html#OmoomiP03
2005-08-08
On a tree graph defined by a set of cycles.
303-310
2003
271
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00132-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm271.html#LiNR03
2005-08-05
Infinite families of crossing-critical graphs with given average degree.
343-350
2003
271
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00136-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm271.html#Salazar03
2005-08-05
Limit shape of optimal convex lattice polygons in the sense of different metrics.
235-249
2003
271
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00045-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm271.html#Stojakovic03
2005-08-05
Distance and connectivity measures in permutation graphs.
61-70
2003
271
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00870-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm271.html#GoddardRS03
2005-08-05
Hamilton-connectivity of 3-domination-critical graphs with alpha leq delta.
1-12
2003
271
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00876-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm271.html#ChenTW03
2005-08-05
Jumping succession rules and their generating functions.
29-50
2003
271
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00868-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm271.html#FerrariPPR03
2005-08-05
Some star extremal circulant graphs.
169-177
2003
271
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00872-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm271.html#Lin03
2005-08-05
Lattice paths and the antiautomorphism of the poset of descending plane partitions.
311-319
2003
271
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00159-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm271.html#Lalonde03
2005-08-05
<i>n</i>=6).
251-260
2003
271
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00046-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm271.html#Switalski03
2005-08-05
Towards a theory of frustrated degeneracy.
179-193
2003
271
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00043-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm271.html#LoeblV03
2005-08-05
Enumerating a class of lattice paths.
13-28
2003
271
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00037-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm271.html#Coker03
2005-08-05
An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree.
321-325
2003
271
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00290-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm271.html#MiaoPW03
2005-08-05
A worthy family of semisymmetric graphs.
283-294
2003
271
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00048-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm271.html#Wilson03
2005-08-05
On graph closures.
141-168
2003
271
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00573-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm271.html#Kelmans03
2005-08-05
On zero-sum subsequences of restricted size II.
51-59
2003
271
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00038-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm271.html#Gao03
2005-08-05
The extremal function for unbalanced bipartite minors.
209-222
2003
271
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00051-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm271.html#Myers03
2005-08-05
A note on trees of maximum weight and restricted degrees.
335-342
2003
271
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00135-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm271.html#Rautenbach03
2005-08-05
Weighted graphs with all Hamiltonian cycles of the same length.
129-139
2003
271
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00041-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm271.html#KabadiP03
2005-08-05
Ranking by outdegree for directed graphs.
261-270
2003
271
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00050-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm271.html#BrinkG03
2005-08-05
The total chromatic number of graphs of even order and high degree.
295-302
2003
271
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00049-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm271.html#XieY03
2005-08-05
On the triangle vertex Folkman numbers.
327-334
2003
271
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00134-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm271.html#Nenov03
2005-08-05
Defending the Roman Empire from multiple attacks.
101-115
2003
271
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00040-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm271.html#Henning03
2005-08-05
Forgetful polygons as generalizations of semi-affine planes.
71-100
2003
271
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00871-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm271.html#GovaertM03
2005-08-05
On the measures of pseudorandomness of binary sequences.
195-207
2003
271
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00044-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm271.html#MauduitS03
2005-08-05
Maximum genus and chromatic number of graphs.
117-127
2003
271
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00289-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm271.html#Huang03
2005-08-26
On the edge-reconstruction of graphs embedded in surfaces IV.
331-338
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00792-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#Zhao03
2005-08-26
Total domination excellent trees.
93-104
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00572-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#Henning03a
2005-08-26
Construction of new extremal self-dual codes.
81-91
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00570-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#GulliverHK03
2005-08-26
Restricted circular-arc graphs and clique cycles.
221-231
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00578-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#McKee03b
2005-08-26
Direct decompositions of non-algebraic complete lattices.
311-321
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00790-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#Wehrung03
2005-08-26
<sup>+</sup>-stable Ko"nig-Egerváry graphs.
179-190
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00528-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#LevitM03
2005-08-26
Partition the vertices of a graph into induced matchings.
323-329
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00791-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#YuanW03
2005-08-26
Bounds for the chromatic number of graphs with partial information.
47-59
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00569-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#CoffmanHS03
2005-08-26
<i>n</i>+1, C) that imply Molev and Reiner-Stanton lattices are strongly Sperner.
61-79
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00523-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#DonnellyLP03
2005-08-26
Symplectic matroids, independent sets, and signed graphs.
35-45
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00568-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#Chow03
2005-08-26
Small meshes of curves and their role in the analysis of optimal meshes.
233-246
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00531-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#Salazar03a
2005-08-26
Rough isometry and energy finite solutions of the Schro"dinger operator on graphs.
167-177
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00576-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#Lee03
2005-08-26
The number of 2-edge-colored complete graphs with unique hamiltonian alternating cycle.
1-10
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00566-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#BenkouarMS03
2005-08-26
A note on graphs of class I.
339-345
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00793-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#Zhou03
2005-08-26
Decomposition formulas of zeta functions of graphs and digraphs.
305-309
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00789-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#Sato03
2005-08-26
Boundary vertices in graphs.
25-34
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00567-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#ChartrandEJZ03
2005-08-26
Sortability of vector partitions.
129-142
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00527-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#HwangLLR03
2005-08-26
A tournament problem.
281-288
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00769-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#Eggar03
2005-08-26
On extensions of pseudo-valuations on Hilbert algebras.
11-24
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00552-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#Busneag03
2005-08-26
Extremal subgraphs with respect to vertex degree bounds.
297-303
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00772-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#RautenbachV03a
2005-08-26
Generalized de Bruijn digraphs and the distribution of patterns in ?-expansions.
247-268
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00533-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#Steiner03
2005-08-26
<i>t</i>-designs.
143-155
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00574-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#KhosrovshahiT03
2005-08-26
Partial cubes as subdivision graphs and as generalized Petersen graphs.
157-165
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00575-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#KlavzarL03
2005-08-26
<i><sub>n</sub></i>-minor free graphs with given circular chromatic number.
191-206
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00529-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#LiawPZ03
2005-08-26
Incremental construction properties in dimension two--shellability, extendable shellability and vertex decomposability.
295-296
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00771-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#MoriyamaT03
2005-08-26
Maximal nonrevisiting paths in simple polytopes.
105-128
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00525-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#Holt03
2005-08-26
The bondage and connectivity of a graph.
289-293
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00770-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#LiuS03
2005-08-26
Dualizing chordal graphs.
207-219
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00577-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#McKee03a
2005-08-26
Anti-Lecture Hall Compositions.
275-280
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00768-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#CorteelS03
2005-08-26
Distance in Post algebras.
269-274
2003
263
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00767-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm263.html#Bankovic03
2005-08-26
Strict colorings of Steiner triple and quadruple systems: a survey.
399-411
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00485-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#MilazzoTV03
2005-09-05
<i>c</i>-Bhaskar Rao designs with small block size.
189-208
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00468-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#DengGO03
2005-08-26
Equitable factorizations of Hamming shells.
177-187
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00467-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#Dejter03
2005-08-26
The spectrum of minimal defining sets of some Steiner systems.
277-284
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00474-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#GrayMMS03
2005-08-26
Two infinite families of failed symmetric designs.
235-241
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00470-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#ResminiJ03
2005-08-26
A new proof of a Colbourn-Rosa problem.
451-458
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00488-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#Yin03
2005-08-26
Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs.
141-156
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00465-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#ColbournL03
2005-10-14
Existence of balanced incomplete block designs for many sets of treatments.
299-324
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00476-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#GreigR03a
2005-08-26
Bicolour graphs of Steiner triple systems.
157-176
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00466-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#DanzigerM03
2005-08-26
Permutations with a distinct difference property.
59-67
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00460-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#BattenS03
2005-08-26
Embedding handcuffed designs in D-designs, where D is the triangle with attached edge.
413-434
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00486-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#Quattrocchi03
2005-08-26
Embeddings of almost resolvable triple systems.
383-398
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00484-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#LiuS03a
2005-08-26
Constructions for Steiner quadruple systems with a spanning block design.
347-360
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00480-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#JiZ03
2005-08-26
<i>k</i><i>n</i><i>k</i><i>kn</i><i>c(k)</i><i>k</i><i>c(k)</i><i>k</i>.
325-336
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00477-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#HoffmanLR03
2005-08-26
On the existence and application of incomplete nearly Kirkman triple systems with a hole of size 6 or 12.
209-233
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00469-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#DengRS03a
2005-08-26
<i>v</i>)-existence results.
3-26
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00457-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#AbelFG03
2005-08-26
Maximal partial spreads in PG(3, 4) and maximal sets of mutually orthogonal latin squares of order 16.
361-371
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00481-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#JungnickelS03
2005-08-26
Constructions for optimal optical orthogonal codes.
127-139
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00464-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#ChangM03
2005-08-26
<i><sub>n, n</sub></i>.
377-382
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00483-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#Ling03
2005-08-26
Power-sequence terraces for where n is an odd prime power.
31-58
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00459-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#AndersonP03
2005-08-26
An application of partition of indices to enclosings of triple systems.
337-346
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00478-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#HurdS03
2005-08-26
<sup>10</sup>.
373-376
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00482-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#KreherLRL03
2005-08-26
A note on the number of graceful labellings of paths.
27-30
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00458-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#AldredSS03
2005-08-26
The existence of near-Rosa and hooked near-Rosa sequences.
435-450
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00487-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#Shalaby03
2005-08-26
Decomposition of complete tripartite graphs into gregarious 4-cycles.
87-111
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00462-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#BillingtonH03
2005-08-26
Preface.
1-2
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00472-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#ColbournDF03
2005-08-26
Existence of cyclic k-cycle systems of the complete graph.
113-125
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00463-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#BurattiF03
2005-08-26
Existence of self-orthogonal diagonal Latin squares with a missing subsquare.
69-86
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00461-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#BennettDZ03
2005-08-26
Vertex-magic labeling of trees and forests.
285-298
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00475-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#GrayMMW03
2005-08-26
On colourings of Steiner triple systems.
255-276
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00473-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#ForbesGG03
2005-08-26
Complementary partial resolution squares for Steiner triple systems.
243-254
2003
261
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00471-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm261.html#DinitzLL03
2005-10-14
Sectionable terraces and the (generalised) Oberwolfach problem.
399-416
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00822-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#OllisP03
2005-09-06
Two conjectures on uniquely totally colorable graphs.
41-45
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00797-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#Akbari03
2005-10-14
<i>k</i>=4 with and without nesting.
3-36
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00795-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#AbelGR03
2005-09-06
Near 2-groups yield an isomorphism with many fixed points.
217-228
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00809-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#Drapal03
2005-09-06
Association schemes and permutation groups.
47-67
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00798-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#AlejandroBC03
2005-09-06
Full embeddings of (alpha, beta)-geometries in projective spaces - Part II.
153-183
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00805-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#Cauchie03
2005-09-06
Multi-letter Youden rectangles from quadratic forms.
143-151
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00804-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#Cameron03a
2006-05-23
Locally grid graphs: classification and Tutte uniqueness.
327-352
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00818-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#MarquezMNR03
2005-09-06
On the span in channel assignment problems: bounds, computing and counting.
387-397
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00821-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#McDiarmid03
2005-10-14
Round-dance neighbour designs from terraces.
69-86
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00799-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#BaileyOP03
2005-09-06
<i>q</i><i>d</i><i>d, q</i>)=1.
377-385
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00820-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#Maruta03
2005-09-06
On two equimatchable graph classes.
263-274
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00813-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#KawarabayashiPS03
2005-09-06
Changing upper irredundance by edge addition.
185-193
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00806-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#CockayneFGGM03
2005-09-06
A circuit axiomatisation of Lagrangian matroids.
109-118
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00801-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#BoothMP03
2005-09-06
A universal bound for a covering in regular posets and its application to pool testing.
293-309
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00815-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#Levenshtein03
2005-09-06
Finite flag-transitive projective planes: a survey and some remarks.
417-429
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00823-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#Thas03
2005-09-06
On the (22, 4)-arcs in PG(2, 7) and related codes.
253-261
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00812-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#HillL03
2005-09-06
An improved upper bound for queens domination numbers.
119-131
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00802-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#BurgerM03
2005-09-06
Preface.
1-2
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00794-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#Woodall03
2005-09-06
Local Ramsey numbers for some graphs.
87-99
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00800-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#Bielak03
2005-09-06
On strong distances in oriented graphs.
195-201
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00807-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#DankelmannSD03
2005-09-06
The structure of totally critical graphs of odd order.
229-238
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00810-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#DugdaleH03
2005-09-06
<i><sub>n, n</sub></i>.
353-375
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00819-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#Martin03
2005-09-06
Research problems from the 18th British Combinatorial Conference.
441-451
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00826-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#Cameron03b
2005-09-06
Finding a maximum induced matching in weakly chordal graphs.
133-142
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00803-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#CameronST03
2005-09-06
On isomorphisms of abelian Cayley objects of certain orders.
203-215
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00808-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#Dobson03
2005-09-06
Cycles in hamiltonian graphs of prescribed maximum degree.
321-326
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00817-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#MarczykW03
2005-09-06
On the number of spikes over finite fields.
261-296
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00629-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#Wu03
2005-09-06
Every cubic cage is quasi 4-connected.
311-320
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00816-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#MarcotePB03
2005-09-06
<i>r, s, t</i>)-inverse quasigroups. I.
275-291
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00814-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#KeedwellS03
2005-09-06
On the quasi-locally paw-free graphs.
37-40
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00796-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#HaddadeneM03
2005-09-06
King independence on triangle boards.
101-107
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00825-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#BodeHH03
2005-09-06
Observability of the extended Fibonacci cubes.
431-440
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00824-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#WhiteheadS03
2005-09-06
Defending the Roman Empire--A new strategy.
239-251
2003
266
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00811-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm266.html#HenningH03
2005-09-06
Illumination of polygons by 45°-floodlights.
251-260
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00583-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#Toth03
2005-09-06
Harmonic graphs with small number of cycles.
31-44
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00620-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#BorovicaninGGP03
2005-09-06
On the determinants of divisor matrices.
375-383
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00880-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#Jeurissen03
2005-09-15
A note on a theorem of Erdös & Gallai.
417-420
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00886-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#TripathiV03
2005-09-06
Chain polynomials of graphs.
213-235
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00581-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#Read03
2005-09-06
<i>n, n</i><i>j</i>)-poset code.
85-104
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00624-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#JangP03
2005-09-06
Centers and medians of distance-hereditary graphs.
279-310
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00630-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#YehC03
2005-09-06
Sequences with group products from finite regular semigroups.
141-158
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00627-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#Loyola03
2005-09-06
Factor criticality and complete closure of graphs.
13-21
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00564-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#AnanchuenS03
2005-09-06
Erratum to "The Beckman-Quarles theorem for rational spaces": [Discrete Mathematics 365 (2003) 311-320].
321-
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00002-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#Zaks03a
2005-09-06
A classification of circulant DCI(CI)-digraphs of 2-power order.
71-84
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00623-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#Huang03a
2005-09-06
<sub>5</sub><sub>2</sub>.
59-70
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00622-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#GulliverOS03
2005-09-06
On the number of Hamiltonian cycles in Dirac graphs.
237-250
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00582-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#SarkozySS03
2005-09-06
<i>g, f</i>)-factors.
385-391
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00881-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#LiM03
2005-09-06
Some operator identities and q-series transformation formulas.
119-139
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00626-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#Liu03a
2005-09-06
A bijection between nonnegative words and sparse abba-free partitions.
411-416
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00885-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#NemecekK03
2005-09-06
Concentration for locally acting permutations.
159-171
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00628-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#LuczakM03
2005-09-06
A partition problem on colored sets.
405-410
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00884-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#Nakamigawa03
2005-09-06
Independent sets of maximum weight in (p, q)-colorable graphs.
351-356
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00877-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#AlekseevL03
2005-09-06
Cycles having the same modularity and removable edges in 2-connected graphs.
23-30
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00565-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#AndoHKKKS03
2005-09-06
The structure of a 3-connected matroid with a 3-separating set of essential elements.
173-187
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00579-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#Oxley03
2005-09-06
Graphs with regular monoids.
105-118
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00625-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#Li03
2005-09-06
Paths of length four.
357-363
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00878-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#BollobasS03
2005-09-06
Combinatorial structure of group divisible designs without alpha-resolution classes in each group.
1-11
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00678-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#AdachiJK03
2005-09-06
Non-repetitive colorings of infinite sets.
365-373
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00879-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#GrytczukS03
2005-09-06
The order type of the collection of finite series-parallel posets.
189-211
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00580-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#PouzetS03
2005-09-06
Total domination and least domination in a tree.
401-404
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00883-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#LvM03
2005-09-06
The Beckman-Quarles theorem for rational spaces.
311-320
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00535-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#Zaks03
2005-09-06
Some identities related to reciprocal functions.
323-335
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00584-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#ZhaoW03
2005-09-06
Hamiltonicity of 3-connected quasi-claw-free graphs.
393-399
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00882-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#Li03a
2005-09-06
Circular chromatic numbers of a class of distance graphs.
337-350
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00631-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#Zhu03
2005-09-06
<sup>r</sup>.
45-57
2003
265
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00621-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm265.html#DeDeo03
2005-09-06
Chordal graphs and the characteristic polynomial.
211-219
2003
262
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00500-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm262.html#McMahonSW03
2005-09-06
<i>H</i>-forming sets in graphs.
159-169
2003
262
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00496-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm262.html#HaynesHHS03
2005-09-06
Matching transformation graphs of cubic bipartite plane graphs.
27-36
2003
262
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00519-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm262.html#BauH03
2005-11-11
<i><sub>n</sub></i>: new drawings, upper bounds, and asymptotics.
59-77
2003
262
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00491-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm262.html#BrodskyDG03
2005-09-06
Constructibility of speed one signal on cellular automata.
195-209
2003
262
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00499-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm262.html#Matamala03
2005-09-06
The existence of three idempotent IMOLS.
1-16
2003
262
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00517-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm262.html#AbelD03
2005-09-06
General congruences for Bernoulli polynomials.
253-276
2003
262
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00504-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm262.html#Sun03
2005-09-06
Bounds on the chromatic number of intersection graphs of sets in the plane.
221-227
2003
262
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00501-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm262.html#Perepelitsa03
2005-09-06
Factor domination and minimum degree.
113-119
2003
262
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00522-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm262.html#DankelmannL03
2005-09-06
On paths and cycles dominating hypercubes.
121-129
2003
262
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00524-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm262.html#DvorakHM03
2005-09-06
A MacWilliams-type identity for linear codes on weak order.
181-194
2003
262
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00498-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm262.html#KimL03
2005-09-06
Linear-time recognition of bipartite graphs plus two edges.
99-112
2003
262
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00493-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm262.html#Damaschke03
2005-09-06
<i>d</i>-domatic colorings of graphs.
17-25
2003
262
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00518-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm262.html#AlonFLSS03
2005-09-06
On self-dual codes over some prime fields.
37-58
2003
262
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00520-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm262.html#BetsumiyaGGHK03
2005-09-06
The icosahedron is clique divergent.
229-239
2003
262
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00502-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm262.html#Pizana03
2005-09-06
On the non-existence of quasi-3 designs.
79-87
2003
262
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00492-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm262.html#BroughtonM03
2005-09-06
Irredundance and domination in kings graphs.
131-147
2003
262
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00494-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm262.html#FavaronFPP03
2005-09-06
Maximum genus of a graph in terms of its embedding properties.
171-180
2003
262
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00497-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm262.html#Huang03b
2005-09-06
Relaxed game chromatic number of graphs.
89-98
2003
262
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00521-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm262.html#ChouWZ03
2005-09-06
On the monotonicity of the broadcast function.
149-157
2003
262
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00495-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm262.html#HarutyunyanL03
2005-09-06
<i>M(n)</i>.
241-252
2003
262
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00503-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm262.html#SavageSW03
2005-09-06
Partitioning Boolean lattices into antichains.
45-55
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00448-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#ElzobiL03
2005-09-06
Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs.
231-238
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00674-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#McKee03c
2005-09-06
Profile minimization on triangulated triangles.
69-76
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00450-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#GuanW03
2005-09-06
<i>n</i>-times nim.
205-209
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00667-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#FranklT03
2005-09-06
<i><sub>r, s</sub></i>-graphic sequences.
295-305
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00765-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#YinL03
2005-09-06
Decompositions of complete graphs and complete bipartite graphs into isomorphic supersubdivision graphs.
137-149
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00455-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#SethuramanS03
2005-09-06
On weights in duadic abelian codes.
223-230
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00673-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#Li03c
2005-09-06
New types of integral sum graphs.
163-176
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00456-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#WuML03
2005-09-06
Bipartite density of cubic graphs.
27-35
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00490-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#BermanZ03
2005-09-06
On 4-chromatic edge-critical regular graphs of high connectivity.
315-319
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00668-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#DobryninMP03
2005-09-06
Remarks on the bondage number of planar graphs.
57-67
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00449-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#FischermannRV03
2005-09-06
The Steiner ratio of several discrete metric spaces.
189-196
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00762-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#Cieslik03
2005-09-06
Labelings of Lee and Hamming spaces.
119-136
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00454-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#AlvesC03
2005-09-06
Optimally super-edge-connected transitive graphs.
239-248
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00675-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#Meng03
2005-09-06
<i>k</i>-connected graph.
1-25
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00489-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#AndoE03
2005-09-06
Erratum to "Edge-choosability in line-perfect multigraphs" [Discrete Mathematics 202 (1999) 191].
323-326
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00676-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#PetersonW03
2005-09-06
Maximum graphs with a unique minimum dominating set.
197-203
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00670-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#FischermannRV03a
2005-09-06
A Vizing-type theorem for matching forests.
211-216
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00671-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#Keijsper03
2005-09-06
Multi-avoidance of generalised patterns.
89-100
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00452-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#Kitaev03
2005-09-06
Classification of Hadamard matrices of order 44 with automorphisms of order 7.
275-283
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00400-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#Topalova03
2005-09-06
<i>k</i><i>d</i>.
285-293
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00593-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#Ye03
2005-09-06
Vertices contained in all or in no minimum total dominating set of a tree.
37-44
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00447-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#CockayneHM03
2005-09-06
<i>a, b</i>]-factors.
217-221
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00672-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#Li03b
2005-09-06
The Hoffman number of a graph.
255-265
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00764-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#Teranishi03
2005-09-06
The extreme set condition of a graph.
151-161
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00534-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#WangH03
2005-09-06
Solvable block transitive automorphism groups of 2-(v, 5, 1) designs.
267-273
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00763-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#TongL03
2005-09-06
A bijective proof of an identity for noncrossing graphs.
249-253
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00677-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#Podbrdsky03
2005-09-06
On some questions of Razpet regarding binomial coefficients.
177-182
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00760-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#BerendK03
2005-09-06
An improved product construction for large sets of Kirkman triple systems.
307-313
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00766-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#ZhangZ03
2005-09-06
A new kind of geometric structures determining the chain good weight hierarchies.
101-117
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00453-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#LuoCF03
2005-09-06
Erratum to "Descendants in highly arc transitive digraphs" [Discrete Mathematics 247 (2002) 147-157].
321-
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00759-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#Moller03
2005-09-06
A note on G-intersecting families.
183-188
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00761-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#BohmanM03
2005-09-06
Strong equality of domination parameters in trees.
77-87
2003
260
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00451-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm260.html#HaynesHS03
2005-09-06
Type I neighbors of extremal type II codes of length 40 derived from Hadamard matrices.
285-291
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00373-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#Dalan02
2005-09-06
A characterization of additive sets.
201-210
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00381-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#Vallejo02
2005-09-06
<i>K</i><i><sub>k</sub></i>-factorization of complete bipartite graphs.
301-306
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00587-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#DuW02
2005-09-06
No iterated morphism generates any Arshon sequence of odd order.
277-283
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00372-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#Currie02
2005-09-06
Connected matroids with a small circumference.
147-161
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00377-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#Maia02
2005-09-06
Kernels in digraphs with covering number at most 3.
121-135
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00375-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#Galeana-Sanchez02
2005-09-06
<i>C</i><sub>4</sub>-saturated bipartite graphs.
263-268
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00371-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#BryantF02
2005-09-06
On a question regarding visibility of lattice points--III.
251-256
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00301-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#AdhikariC02
2005-09-06
A note about the dominating circuit conjecture.
307-309
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00588-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#FleischnerK02
2005-09-06
Searching for semifield flocks.
179-188
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00379-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#Pinneri02
2005-09-06
A criterion for the applicability of Zeilberger's algorithm to rational functions .
1-17
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00442-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#AbramovL02
2005-09-06
<i>k</i>-trees with maximum chromatic number.
269-276
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00586-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#Chlebikova02
2005-09-06
The homomorphism problem for the free monoid.
189-200
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00380-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#Silva02
2005-09-06
A closure concept in factor-critical graphs.
319-324
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00303-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#Nishimura02
2005-09-06
Diameter-essential edges in a graph.
211-225
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00382-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#WalikarBI02
2005-09-06
On the rank polynomial of the lattice of order ideals of fences and crowns.
163-177
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00378-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#MunariniS02
2005-09-06
On the reconstruction of the degree sequence.
293-300
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00374-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#DelormeFR02
2005-09-13
Two conjectures equivalent to the perfect graph conjecture.
347-351
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00403-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#Xu02
2005-09-06
One edge union of shell graphs and one vertex union of complete bipartite graphs are cordial.
343-350
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00305-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#SethuramanS02
2005-09-06
<i>k</i><i>k</i>graphs.
361-368
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00542-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#TogasakiY02
2005-09-06
Application des fonctions symétriques à la résolution d'équations différentielles autonomes combinatoires.
71-90
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00446-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#Chiricota02
2005-09-06
An intersection graph of straight lines.
359-360
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00591-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#Thomassen02
2005-09-06
Cycle cover property and CPP=SCC property are not equivalent.
337-342
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00590-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#Rizzi02
2005-09-06
Independence and connectivity in 3-domination-critical graphs.
227-236
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00383-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#ZhangT02
2005-09-06
<i><sub>p</sub></i>-metrics.
237-250
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00384-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#Zunic02
2005-09-06
Independence, irredundance, degrees and chromatic number in graphs.
257-262
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00585-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#BacsoF02
2005-09-06
An inequality between the diameter and the inverse dual degree of a tree.
351-358
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00541-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#SiuZZ02
2005-09-06
Graphs with chromatic polynomial sum(...).
369-381
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00592-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#YeL02
2005-09-06
Factoring the cartesian product of a cubic graph and a triangle.
137-146
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00376-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#HortonW02
2005-09-06
Equimodular curves.
37-57
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00444-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#Biggs02
2005-09-06
On generalized Petersen graphs labeled with a condition at distance two.
311-318
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00302-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#GeorgesM02
2005-09-06
Balanced nested designs and balanced arrays.
91-119
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00356-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#Fuji-HaraKKMS02
2005-09-06
Reconstruction up to isometries.
331-336
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00589-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#RautenbachT02
2005-09-06
A sufficient condition for a bipartite graph to be a cube.
383-386
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00543-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#Wenzel02
2005-09-06
Independent domination and matchings in graphs.
325-330
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00304-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#RautenbachV02
2005-09-06
Thresholds for random distributions on graph sequences with applications to pebbling.
59-69
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00445-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#Boyle02
2005-09-06
Restricted permutations and the wreath product.
19-36
2002
259
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00443-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm259.html#AtkinsonS02
2005-09-13
Fast evaluation, weights and nonlinearity of rotation-symmetric functions.
289-301
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00354-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#CusickS02
2005-09-13
Lattice animals and heaps of dimers.
235-274
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00352-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#Bousquet-MelouR02
2005-09-13
<i>k</i><i>n</i>-2.
193-204
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00298-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#StevensBEIMSVVYZ02
2005-09-13
Regular embeddings of complete bipartite graphs.
379-381
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00539-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#NedelaSZ02
2005-09-13
A note on the spectra of certain skew-symmetric {1, 0, -1}-matrices.
339-346
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00402-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#Wesp02
2005-09-13
A note on a conjecture of Dirac.
323-330
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00394-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#Lattanzio02
2005-09-13
Le treillis des chemins de Delannoy.
225-234
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00351-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#AutebertLS02
2005-09-13
Defective choosability results for outerplanar and related graphs.
215-223
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00300-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#Woodall02
2005-09-13
On geometric independency trees for points in the plane.
93-104
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00264-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#KanekoOY02
2005-09-13
Longest paths through an arc in strong semicomplete multipartite digraphs.
331-337
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00401-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#Volkmann02
2005-09-13
Whitney triangulations, local girth and iterated clique graphs.
123-135
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00266-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#LarrionNP02
2005-09-13
Regular factors in regular multipartite graphs.
43-62
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00261-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#Hoffmann02
2005-09-13
A pumping lemma for DLI-languages.
105-122
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00265-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#Kaszonyi02
2005-09-13
Conditional edge connectivity properties, reliability comparisons and transitivity of graphs.
205-214
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00299-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#WangL02
2005-09-13
<i>C</i><sub>4</sub>-free Berge graphs.
137-160
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00267-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#ParfenoffRR02
2005-09-13
Equitable colorings of outerplanar graphs.
373-377
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00538-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#Kostochka02
2005-09-13
Juggling and vector compositions.
179-191
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00269-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#Stadler02
2005-09-13
<i>K</i><sub>4</sub>-homeomorphs.
161-177
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00268-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#PengL02
2005-09-13
Dense critical and vertex-critical graphs.
63-84
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#Jensen02
2005-09-13
On cop-win graphs.
27-41
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00260-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#HahnLSW02
2005-09-13
Total domination supercritical graphs with respect to relative complements.
361-371
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00537-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#HaynesHM02
2005-09-13
On parameters related to strong and weak domination in graphs.
1-11
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00257-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#DomkeHMU02
2005-09-13
Disconnected coverings for oriented matroids via simultaneous mutations.
353-359
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00536-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#ForgeAY02
2005-09-13
On generalized Ramsey numbers.
383-388
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00540-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#ShiuLL02
2005-09-13
Chromaticity of some families of dense graphs.
303-321
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00355-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#DongTLH02
2005-09-13
Catalan continued fractions and increasing subsequences in permutations.
275-287
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00353-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#BrandenCS02
2005-09-13
On a hamiltonian cycle in which specified vertices are not isolated.
85-91
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00263-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#KanekoKOY02
2005-09-13
Disjunctive and conjunctive representations in finite lattices and convexity spaces.
13-25
2002
258
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00259-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm258.html#FoldesH02
2005-09-13
2-factors in dense bipartite graphs.
357-369
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00435-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#CzygrinowK02
2005-09-13
On a 2-factor with a specified edge in a graph satisfying the Ore condition.
445-461
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00506-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#KanekoY02
2005-09-13
Research problems.
599-624
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00619-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#X02
2006-02-15
A finite basis characterization of ?-split colorings.
415-421
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00440-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#GyarfasKL02
2005-09-13
<i>p, Q</i>)-free families.
385-403
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00437-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#FurediGR02
2005-09-13
On isomorphisms of finite Cayley graphs--a survey.
301-334
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00438-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#Li02
2005-09-13
Sums of minima and maxima.
143-159
2002
257
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(01)00476-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#Sun02
2005-09-13
Kleitman and combinatorics.
225-247
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00596-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#Saks02
2005-09-13
Edge-coloring critical graphs with high degree.
169-172
2002
257
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(02)00395-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#MiaoW02
2005-09-13
Polyunsaturated posets and graphs and the Greene-Kleitman theorem.
329-340
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00433-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#Chappell02
2005-09-13
On separable self-complementary graphs.
165-168
2002
257
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(02)00399-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#KawarabayashiNOOTW02
2005-09-13
On the number of edges in graphs with a given weakly connected domination number.
111-124
2002
257
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(01)00474-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#Sanchis02
2005-09-13
Graphs induced by Gray codes.
585-598
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00516-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#WilmerE02
2005-09-13
On the distribution of the number of monotone Boolean functions relative to the number of lower units.
463-479
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00507-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#KorshunovS02
2005-09-13
Doodles and doilies, non-simple symmetric Venn diagram.
423-439
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00441-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#Hamburger02
2005-09-13
Intersecting families with minimum volume.
411-414
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00439-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#Grigg02
2005-09-13
On halving line arrangements.
267-283
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00430-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#BeygelzimerR02
2005-09-13
4-connected maximal planar graphs are 4-ordered.
405-410
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00438-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#Goddard02
2005-09-13
Planar Hamiltonian chordal graphs are cycle extendable.
441-444
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00505-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#Jiang02
2005-10-31
<sub>3</sub><i><sub>q</sub></i><i>q</i>even).
15-27
2002
257
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(02)00255-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#CorbasW02
2005-09-13
A random stacking process.
541-547
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00512-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#Schulman02
2005-09-13
Kleitman and Combinatorics: A Celebration.
193-224
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00595-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#Peck02
2005-09-13
Bipartite graphs without a skew star.
83-100
2002
257
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(01)00471-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#Lozin02
2005-09-13
Counting dyadic equipartitions of the unit square.
481-499
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00508-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#LagariasSV02
2005-09-13
Laplacian spectra and invariants of graphs.
183-189
2002
257
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(02)00398-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#Teranishi02
2005-09-13
A combinatorial approach to correlation inequalities.
311-327
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00432-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#BrightwellT02
2005-09-13
Covering a hypergraph of subgraphs.
249-254
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00427-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#Alon02
2005-12-22
<i>d</i>digraphs.
371-384
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00436-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#DuHNP02
2005-09-13
Sperner theory in a difference of Boolean lattices.
501-512
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00509-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#Logan02
2005-09-13
<i>T</i><i>T</i>-pairings.
177-181
2002
257
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(02)00397-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#Rizzi02a
2005-09-13
Error-correcting codes from graphs.
549-557
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00513-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#Tonchev02
2005-09-13
A cycle lemma for permutation inversions.
1-13
2002
257
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(02)00254-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#BrunettiLR02
2005-09-13
On partitions of discrete boxes.
255-258
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00428-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#AlonBHK02
2005-09-13
The Ramsey size number of dipaths.
173-175
2002
257
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(02)00396-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#Reimer02
2005-09-13
A local-global principle for vertex-isoperimetric problems.
285-309
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00431-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#BezrukovS02
2005-09-13
On restricted edge-colorings of bicliques.
513-529
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00510-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#MubayiW02
2005-09-13
On large sets of disjoint Kirkman triple systems.
63-81
2002
257
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(01)00470-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#Lei02
2005-09-13
Foreword.
191-192
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00594-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#CowenGW02
2005-09-13
<i>p</i>-group.
559-574
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#Wang02
2005-09-13
Retractions of split graphs and End-orthodox split graph.
161-164
2002
257
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(02)00388-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#Fan02
2005-09-13
On the average size of sets in intersecting Sperner families.
259-266
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00429-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#BeyEKL02
2005-09-13
A note on triangle-free and bipartite graphs.
531-540
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00511-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#PromelSS02
2005-09-13
On spectral bounds for cutsets.
101-109
2002
257
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(01)00473-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#RodriguezGY02
2005-09-13
<i>q</i>-Pell sequences and two identities of V.A. Lebesgue.
125-142
2002
257
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(01)00475-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#SantosS02
2006-01-31
A chip-firing game and Dirichlet eigenvalues.
341-355
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00434-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#ChungE02
2005-09-13
On the Randic Image index.
29-38
2002
257
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(02)00256-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#DelormeFR02a
2005-09-13
Line graphs of complete multipartite graphs have small cycle double covers.
39-61
2002
257
Discrete Mathematics
1
http://dx.doi.org/10.1016/S0012-365X(02)00258-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#FishKS02
2005-09-13
The patterns of permutations.
575-583
2002
257
Discrete Mathematics
2-3
http://dx.doi.org/10.1016/S0012-365X(02)00515-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm257.html#Wilf02
2005-09-13
Symmetries in trees and parking functions.
719-741
2002
256
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(02)00344-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#Kalikow02
2005-09-13
Foreword.
523-525
2002
256
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(02)00318-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#LabelleL02
2005-09-13
On two determinants with interesting factorizations.
449-458
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00208-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#CopelandSS02
2005-09-13
Hamilton cycles in random subgraphs of pseudo-random graphs.
137-150
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00464-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#FriezeK02
2005-09-13
Dirac-type characterizations of graphs without long chordless cycles.
445-448
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00166-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#ChvatalRS02
2005-09-13
Tight bound for the density of sequence of integers the sum of no two of which is a perfect square.
243-255
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00435-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#KhalfalahLS02
2005-09-13
On the reconstruction of perfect codes.
479-485
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(02)00391-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#Heden02
2005-09-13
A new lower bound on upper irredundance in the queens' graph.
225-242
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00467-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#KearseG02
2005-09-13
Worst case asymptotics of power-weighted Euclidean functionals.
291-300
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00437-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#Lee02
2005-09-13
A partition-based approach towards constructing Galois (concept) lattices.
801-829
2002
256
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(02)00349-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#ValtchevML02
2005-09-13
<i>q</i>-Enumeration of alternating sign matrices with exactly one -1.
759-773
2002
256
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(02)00346-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#Lalonde02
2005-09-13
Enumeration of Cayley graphs and digraph.
527-539
2002
256
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(02)00319-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#AlspachM02
2005-09-13
Block-cutvertex trees and block-cutvertex partitions.
35-54
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00461-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#Barefoot02
2005-09-13
The interval number of dense graphs.
423-429
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00215-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#BaloghP02
2005-09-13
A bijection between ordered trees and 2-Motzkin paths and its many consequences.
655-670
2002
256
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(02)00341-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#DeutschS02
2005-09-13
Containment orders for similar ellipses with a common center.
129-136
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(00)00366-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#FishburnT02
2005-09-13
Binary and ternary codes of covering radius one: some new lower bounds.
161-178
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(00)00461-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#Haas02
2005-09-13
Total irredundance in graphs.
115-127
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(00)00459-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#FavaronHHHK02
2005-09-13
Further decompositions of complete tripartite graphs into 5-cycles.
55-81
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00462-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#Cavenagh02
2005-09-13
Universal graphs without large bipartite graphs assuming GCH.
509-512
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00229-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#Shafir02
2005-09-13
Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set.
193-201
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(02)00571-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#HarantRS02
2005-09-13
Tirage à pile ou face de mots de Fibonacci.
791-800
2002
256
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(02)00348-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#PenaudR02
2006-05-26
On generalized van der Waerden triples.
279-290
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00436-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#LandmanR02
2005-09-13
On the space chromatic number.
499-507
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(00)00406-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#Nechushtan02
2005-09-13
Edge-cuts leaving components of order at least three.
431-439
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(02)00385-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#BonsmaUV02
2005-09-13
Non-conformable subgraphs of non-conformable graphs.
203-224
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00433-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#HiltonH02
2005-09-13
Planar sets containing no three collinear points and non-averaging sets of integers.
387-395
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00441-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#Stanchescu02
2006-06-09
A proof of the q, t-Catalan positivity conjecture.
677-717
2002
256
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(02)00343-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#GarsiaH02
2005-09-13
Isomorphism certificates for undirected graphs.
349-359
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00440-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#MolloyS02
2005-09-27
On the injective chromatic number of graphs.
179-192
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00466-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#HahnKSS02
2005-09-13
<i>q</i>-Analogs of symmetric function operators.
831-853
2002
256
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(02)00350-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#Zabrocki02
2005-09-13
<i>L</i>-functions for images of graph coverings by some operations.
335-347
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00439-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#MizunoS02
2005-09-13
On the identity of the sandpile group.
775-790
2002
256
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(02)00347-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#BorgneR02
2005-09-13
Upper bounds on the automorphism group of a graph0.
489-493
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(02)00393-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#KrasikovLT02
2005-09-13
<sub>7</sub>.
471-477
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(02)00389-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#HaradaO02
2005-09-13
Nouvelles statistiques de partitions pour les q-nombres de Stirling de seconde espe`ce.
743-758
2002
256
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(02)00345-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#KsavrelofZ02
2005-09-13
Strongly regular graphs from differences of quadrics.
465-469
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(02)00390-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#Hamilton02
2005-09-13
A note on the ultimate categorical matching in a graph.
487-488
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(02)00392-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#Hsu02
2005-09-13
Hamiltonian iterated line graphs.
407-422
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00442-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#XiongL02
2005-09-13
A reduced formula for the precise number of (0, 1)-matrices in A(R, S).
361-372
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00472-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#Perez-SalvadordGT02
2005-09-13
The incidence coloring number of Halin graphs and outerplanar graphs.
397-405
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00302-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#WangCP02
2005-09-13
Game domination number.
23-33
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(00)00358-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#AlonBBS02
2005-09-13
Generalizations of Eulerian partially ordered sets, flag numbers, and the Mo"bius function.
577-593
2002
256
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(02)00336-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#BayerH02
2005-09-13
<i>b</i>-chromatic number of a grap.
267-277
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00469-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#KouiderM02
2005-09-13
Pancyclicity in claw-free graphs.
151-160
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00465-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#GouldP02
2005-09-13
Modified group divisible designs with block size 5 and lambda=1.
1-22
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00430-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#AbelA02
2005-09-13
A 15-colouring of 3-space omitting distance one.
83-90
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00183-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#Coulson02
2005-09-13
A proof of a conjecture of minus domination in graphs.
519-521
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00316-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#WangM02
2005-09-13
On certain spaces of lattice diagram determinants.
557-575
2002
256
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(02)00335-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#Aval02
2005-09-13
On vertex-degree restricted subgraphs in polyhedral graphs.
105-114
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#Fabrici02
2005-09-13
Enumeration of multi-colored rooted maps.
541-556
2002
256
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(02)00320-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#ArquesM02
2005-09-13
Towards the inverse of a word.
595-607
2002
256
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(02)00337-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#Clarke02
2005-09-13
Yet another approach to the extended ternary Golay code.
459-464
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(02)00387-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#Drapal02
2005-09-13
Extreme weight classes of de Bruijn sequences.
495-497
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00425-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#Mayhew02
2005-09-13
Plane triangulations are 6-partitionable.
91-103
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00463-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#DiwanK02
2005-09-13
Interpre'tation bijective d'une re'currence des nombres de Motzkin.
671-676
2002
256
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(02)00342-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#DulucqP02
2005-09-13
A note on the Gallai-Roy-Vitaver Theorem.
441-444
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(02)00386-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#ChangTYY02
2005-09-13
Orthogonal Matchings.
513-518
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00315-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#Stong02
2005-09-13
Centering small generalized polygons-projective pottery at work.
373-386
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(02)00530-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#Polster02
2005-09-13
2-connected and 2-edge-connected Steinhaus graphs.
257-265
2002
256
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(01)00468-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#KimL02
2005-09-13
Diagonally convex directed polyominoes and even trees: a bijection and related issues.
645-654
2002
256
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(02)00340-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#DeutschFN02
2005-09-13
Enumeration of sand piles.
625-643
2002
256
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(02)00339-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#CorteelG02
2005-09-13
<i>p, q</i>)-parking functions .
609-623
2002
256
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(02)00338-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm256.html#CoriP02
2005-09-13
Linear spaces with projective lines.
249-258
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00402-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#Kreuzer02
2005-09-13
<i>k</i><i>PG</i><i>q</i>).
135-144
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00394-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#Giulietti02
2005-09-13
The observability of the Fibonacci and the Lucas cubes.
55-63
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00387-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#DedoTS02
2005-09-13
Overlarge sets of 2-(11, 5, 2) designs and related configurations.
275-286
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00404-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#MathonS02
2005-09-13
Embedding path designs in 4-cycle systems.
349-356
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00410-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#Quattrocchi02
2005-09-13
Fibered geometries.
259-274
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00403-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#KuijkenM02
2005-09-13
<i>G</i><i>K</i><sub>v</sub><i>G</i>has four nonisolated vertices or les.
297-315
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00406-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#MiliciQ02
2005-09-13
<i>n</i><i>n</i>-2)-dimensional subspace.
81-85
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00390-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#Eisfeld02
2005-09-13
K-loops derived from Frobenius groups.
225-234
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00400-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#KarzelPZ02
2005-09-13
<i>W</i><sub>12</sub>based on quadrics of PG(2, 3).
189-192
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00398-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#Havlicek02
2005-09-13
<i>p</i>-cycles.
13-23
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00383-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#BalbuenaPG02
2005-09-13
On the system of fixed points of a collineation in noncommutative projective geometry.
65-70
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00388-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#Donati02
2005-09-13
<sub>5</sub>x2.
35-45
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00385-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#CaraL02
2005-09-13
Small vertex-transitive directed strongly regular graphs.
87-115
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00391-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#FiedlerKM02
2005-09-13
Minimum multiplicities of subgraphs and Hamiltonian cycles.
357-366
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00411-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#Sheehan02
2005-09-13
On large complete arcs: odd case.
145-159
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00395-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#GiuliettiPTU02
2005-09-13
<i>s, t</i>}-semiaffine linear spaces.
325-341
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00408-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#Napolitano02
2005-09-13
<i>q</i>).
287-296
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00405-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#MetschS02
2005-09-13
On some Kantor flocks.
3-6
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00381-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#BaderR02
2005-09-13
<i>K</i>-loops.
161-179
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00396-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#GiuzziK02
2005-09-13
Finite linear spaces with b-v in {M, M+1}.
71-80
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00389-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#Durante02
2005-09-13
<i><sup>t</sup></i>).
343-348
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00409-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#PolitoP02
2005-09-13
Quasiparallel planes in finite planar spaces.
117-124
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00392-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#Freni02
2005-09-13
Divisible designs from semifield planes.
47-54
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00386-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#Cerroni02
2005-09-13
<i>n, q</i><i>q</i>).
381-386
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00413-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#Zanella02
2005-09-13
Structural and enumerative properties of the Fibonacci cubes.
317-324
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00407-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#MunariniS02a
2005-09-13
<sup>ast</sup>-geometries.
193-223
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00399-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#Huybrechts02
2005-09-13
Small almost complete arcs.
367-379
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00412-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#Ughi02
2005-09-13
<sub>1, 3</sub>.
7-12
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00382-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#BakerBCE02
2005-09-13
<i>m</i>-Clouds in generalized hexagons.
25-33
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00384-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#BrounsTM02
2005-09-13
Complete arcs in inversive planes over prime fields.
181-188
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00397-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#HadnagyS02
2005-09-13
<i>v</i>).
125-133
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00393-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#Gionfriddo02
2005-09-13
Frobenius groups with many involutions.
235-247
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00401-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#Kiechle02
2005-09-13
Editorial.
1-
2002
255
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00380-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm255.html#Bartolone02
2005-09-19
Helly-type theorems for polygonal curves.
527-537
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00379-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#Swanepoel02
2005-09-19
MSO zero-one laws on random labelled acyclic graphs.
331-347
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00375-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#McColm02
2005-09-19
The induced path convexity, betweenness, and svelte graphs.
349-370
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00296-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#MorganaM02
2005-09-19
Log-concavity and compressed ideals in certain Macaulay posets.
421-432
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00360-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#Pitteloud02
2005-09-19
A disproof of Henning's conjecture on irredundance perfect graphs.
539-554
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00300-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#VolkmannZ02
2005-09-19
Existence of resolvable group divisible designs with block size four I.
513-525
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00299-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#ShenS02
2005-09-19
Diagonal flips in outer-triangulations on closed surfaces.
63-74
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00353-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#CortesGMN02
2005-09-19
Columns of uniform color in a rectangular array with rows having cyclically repeated color patterns.
371-392
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00359-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#NagpaulJ02
2005-09-19
Combinatorial PDEs on Hamming graphs.
1-18
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00363-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#BarlettaD02
2005-09-19
On the kernels of the incidence matrices of graphs.
165-174
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00370-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#Hazama02
2005-09-19
Restricted domination in graphs.
175-189
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00371-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#Henning02
2005-09-19
Tripartite version of the Corrádi-Hajnal theorem.
289-308
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00373-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#MagyarM02
2005-09-19
Transitive large sets of disjoint decompositions and group sequencings.
207-219
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00434-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#KaplanLR02
2005-09-19
Statistics on non-crossing trees.
75-87
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00366-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#DeutschN02
2005-09-19
Formal series over sorted algebras.
231-258
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00294-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#Kuich02
2005-09-19
Minimizing algebraic connectivity over connected graphs with fixed girth.
115-142
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00355-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#FallatKP02
2005-09-19
Combinatorics of geometrically distributed random variables: value and position of large left-to-right maxima.
459-471
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00362-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#Prodinger02
2005-09-19
Equivalences between hamiltonicity and flow conjectures, and the sublinear defect property.
221-230
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00372-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#Kochol02
2005-09-19
Construction of regular languages and recognizability of polynomials.
485-496
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00377-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#Rigo02
2005-09-19
The upper bound of essential cyclomatic numbers of hypergraphs.
555-564
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00301-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#WangL02a
2005-09-19
Totally magic graphs.
103-113
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00367-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#ExooLMPW02
2005-09-19
Factorizations of large cycles in the symmetric group.
433-458
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00361-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#PoulalhonS02
2005-09-20
<i>k</i>-colorings.
19-32
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00431-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#BiedlCCDDFW02
2005-09-19
Galois theory for minors of finite functions.
405-419
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00297-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#Pippenger02
2005-09-19
Tight relation between the circular chromatic number and the girth of series-parallel graphs.
393-404
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00376-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#PanZ02
2005-09-19
On the combinatorics of polynomial generalizations of Rogers-Ramanujan-type identities.
497-511
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00378-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#Santos02
2005-09-19
Dyck paths and a bijection for multisets of hook numbers.
153-164
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00356-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#GouldenY02
2005-09-19
Incomplete perfect Mendelsohn designs with block size four.
565-597
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00342-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#Zhang02
2006-05-23
<i>K</i><sub>4, 4</sub>.
143-151
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00369-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#FitzpatrickMM02
2005-09-19
On strongly identifying codes.
191-205
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00357-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#HonkalaLR02
2005-09-19
The edge-isoperimetric problem for discrete tori.
33-49
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00432-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#Carlson02
2005-09-19
On the spectral Ádám property for circulant graphs.
309-329
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00374-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#MansPS02
2005-09-19
Embeddability of the combinohedron.
473-483
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00298-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#AlfonsinR02
2005-09-19
Hamilton cycles in 1-tough triangle-free graphs.
275-287
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00358-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#LiWYZ02
2005-09-19
<i>k</i><i><sub>n</sub></i><i><sub>n, n</sub></i>.
51-61
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00365-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#ChenH02
2005-09-19
On large sets of Kirkman systems with holes.
259-274
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00295-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#Lei02a
2005-09-19
On interval clutters.
89-102
2002
254
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00354-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm254.html#Ding02
2005-09-19
Ascending subgraph decompositions of regular graphs.
11-18
2002
253
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00445-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm253.html#FuH02
2005-09-19
<i>d</i>-Disjunct matrices: bounds and Lova'sz Local Lemma.
97-107
2002
253
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00452-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm253.html#Yeh02
2005-09-19
On Hedetniemi's conjecture and the colour template scheme.
77-85
2002
253
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00450-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm253.html#TardifZ02
2005-09-20
Rivest-Vuillemin conjecture is true for monotone boolean functions with twelve variables.
19-34
2002
253
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00446-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm253.html#GaoDHJ02
2005-09-19
The typenumber of trees.
3-10
2002
253
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00444-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm253.html#FuS02
2005-09-19
Edge-gracefulness of the composition of paths with null graphs.
63-76
2002
253
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00449-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm253.html#ShiuLC02
2005-09-19
A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs.
87-95
2002
253
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00451-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm253.html#WangL02b
2005-09-19
Preface.
1-
2002
253
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(02)00038-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm253.html#HwangZ02
2005-09-19
A Ramsey theorem for countable homogeneous directed graphs.
45-61
2002
253
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00448-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm253.html#Sauer02
2005-09-19
Resonance graphs of catacondensed even ring systems are median.
35-43
2002
253
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00447-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm253.html#KlavzarZB02
2005-09-19
A remarkable eight-point planar configuration.
103-122
2002
252
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00134-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm252.html#Fishburn02
2005-09-19
The Chvátal-ErdImages condition for panconnectivity of triangle-free graphs.
203-214
2002
252
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00285-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm252.html#WeiZ02
2005-09-19
Vertex distinguishing colorings of graphs with Delta(G)=2.
17-29
2002
252
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00287-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm252.html#BalisterBS02
2005-09-19
Bandwidth of the cartesian product of two connected graphs.
227-235
2002
252
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00455-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm252.html#KojimaA02
2005-09-19
Complex Golay sequences: structure and applications.
73-89
2002
252
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00162-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm252.html#CraigenHK02
2005-09-19
Three forbidden subgraphs for line graphs.
287-292
2002
252
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00459-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm252.html#YangLW02
2005-09-19
PBIB designs and association schemes obtained from finite rings.
267-277
2002
252
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00231-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm252.html#Sun02a
2005-09-19
Embedding extended Mendelsohn triple systems.
47-55
2002
252
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00288-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm252.html#CastellanaR02
2005-09-19
Hajós' conjecture and projective graphs.
91-101
2002
252
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00290-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm252.html#FanX02
2005-09-19
On opposite orthogonal Steiner triple systems of non-prime-power order.
215-218
2002
252
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00453-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm252.html#Dukes02
2005-09-19
The kissing number of the regular pentagon.
293-298
2002
252
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00460-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm252.html#ZhaoX02
2005-09-19
On incidence coloring for some cubic graphs.
259-266
2002
252
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00457-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm252.html#ShiuLC02a
2005-09-19
<i>K</i><sub>4</sub>homeomorphs.
247-257
2002
252
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00456-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm252.html#Ren02
2005-09-19
Regular integral sum graphs.
237-245
2002
252
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00426-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm252.html#MelnikovP02
2005-09-19
The average connectivity of a graph.
31-45
2002
252
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00180-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm252.html#BeinekeOP02
2005-09-19
<i><sup>n</sup></i><i>p</i><i>n</i>>2.
189-201
2002
252
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00284-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm252.html#Wang02a
2005-09-19
On the number of h-connected graphs with a fixed diameter.
279-285
2002
252
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00458-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm252.html#Tomescu02
2005-09-19
On the decomposition dimension of trees.
219-225
2002
252
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00454-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm252.html#EnomotoN02
2005-09-19
<i>C</i><sub>4</sub>-structure.
141-159
2002
252
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00291-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm252.html#Hoang02
2005-09-19
<i>p</i><i>q</i>-L-functions and sums of powers.
179-187
2002
252
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00293-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm252.html#Kim02
2005-09-19
Domination graphs of regular tournaments.
57-71
2002
252
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00289-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm252.html#ChoKL02
2005-09-19
Existence of Steiner seven-cycle systems.
1-16
2002
252
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00357-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm252.html#AbelBGZ02
2005-09-19
The stable set polytope and some operations on graphs.
123-140
2002
252
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00273-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm252.html#FonluptH02
2005-09-19
On interleaved sequences over finite fields.
161-178
2002
252
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00292-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm252.html#JiangDG02
2005-09-19
Minimal reducible bounds in the lattice of additive hereditary graph properties.
3-10
2002
251
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00322-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm251.html#Berger02
2005-09-20
Preface.
1-
2002
251
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00320-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm251.html#HornakJ02
2005-09-19
Hamiltonicity of planar cubic multigraphs.
163-168
2002
251
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00337-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm251.html#Skupien02
2005-09-19
Some extremal problems of graphs with local constraints.
19-32
2002
251
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00324-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm251.html#BorowieckiS02
2005-09-19
<i>n, n</i>-1)-graphs.
173-179
2002
251
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00339-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm251.html#Wozniak02
2005-09-19
On 2-regular subgraphs in polyhedral graphs.
97-102
2002
251
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00329-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm251.html#Goring02
2005-09-19
On the domination number of a graph.
129-136
2002
251
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00334-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm251.html#Pruchnewski02
2005-09-19
On light graphs in the family of 4-connected planar graphs.
103-107
2002
251
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00330-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm251.html#Hexel02
2005-09-19
On induced Ramsey numbers.
87-96
2002
251
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00328-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm251.html#GorgolL02
2005-09-19
Three-colourability and forbidden subgraphs. II: polynomial algorithms.
137-153
2002
251
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00335-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm251.html#RanderathST02
2005-09-19
A note on planar 5-list colouring: non-extendability at distance 4.
169-172
2002
251
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00338-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm251.html#TuzaV02
2005-09-19
On pancyclism in hamiltonian graphs.
119-127
2002
251
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00333-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm251.html#KouiderM02a
2005-09-19
Meet- and join-irreducibility of additive hereditary properties of graphs.
11-18
2002
251
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00323-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm251.html#BergerBMM02
2005-09-19
Forbidden triples for hamiltonicity.
71-76
2002
251
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00326-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm251.html#Brousek02
2005-09-19
A 4-colour problem for dense triangle-free graphs.
33-46
2002
251
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00340-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm251.html#Brandt02
2005-09-19
<i>K</i><sub>2, 3</sub><i>C</i><sub>3</sub>.
109-117
2002
251
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00332-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm251.html#Klesc02
2005-09-19
Two matroidal families on the edge set of a graph.
155-162
2002
251
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00336-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm251.html#Recski02
2005-09-19
A note on hamiltonicity of generalized net-free graphs of large diameter.
77-85
2002
251
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00327-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm251.html#BrousekFR02
2005-09-28
On some intriguing problems in hamiltonian graph theory--a survey.
47-69
2002
251
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00325-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm251.html#Broersma02
2005-09-19
Odd subgraphs and matchings.
265-272
2002
250
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00424-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm250.html#KanoK02
2005-09-19
Discrepancy in different numbers of colors.
63-70
2002
250
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00271-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm250.html#Doerr02
2005-09-19
Essential independent sets and long cycles.
109-123
2002
250
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00277-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm250.html#Hirohata02
2005-09-19
Cyclic BSEC of block size 3.
291-298
2002
250
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00429-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm250.html#Wei02
2005-09-19
<i><sup>n</sup>b</i><sup>1</sup>.
211-230
2002
250
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00213-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm250.html#XuZZ02
2005-09-19
Homeomorphs and amallamorphs of the Petersen graph.
281-289
2002
250
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00428-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm250.html#ShahmohamadW02
2005-09-19
The vertex-cover polynomial of a graph.
71-78
2002
250
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00272-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm250.html#DongHTL02
2005-09-19
Reconstructing infinite objects.
273-279
2002
250
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00427-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm250.html#Rautenbach02
2005-09-19
<i>P</i><sub>5</sub>, diamond)-free graphs.
1-22
2002
250
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00268-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm250.html#ArbibM02
2005-09-19
Signed 2-independence in graphs.
93-107
2002
250
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00275-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm250.html#Henning02a
2005-09-19
Divisor matrices and magic sequences.
125-135
2002
250
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00278-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm250.html#Jeurissen02
2005-09-19
Bijections for ternary trees and non-crossing trees.
181-195
2002
250
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00282-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm250.html#PanholzerP02
2005-09-19
Trade spectra of complete partite graphs.
23-39
2002
250
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00269-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm250.html#BillingtonH02
2005-09-19
Some progress on the Aharoni-Korman conjecture.
79-91
2002
250
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00185-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm250.html#DuffusG02
2005-09-19
On centroid branches of trees from certain families.
153-170
2002
250
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00280-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm250.html#MeirM02
2005-09-19
<sup>2</sup>)leq Theta(G).
259-264
2002
250
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00423-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm250.html#KangKSN02
2005-09-19
Hamiltonian cycles in 3-connected Claw-free graphs.
137-151
2002
250
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00279-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm250.html#LiLL02
2005-09-19
<i>K</i><i>K</i>).
171-180
2002
250
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00281-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm250.html#Napolitano02a
2005-09-19
A note on a consistency property for permutations.
241-244
2002
250
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00346-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm250.html#DerksP02
2005-09-19
Weighted domination in triangle-free graphs.
233-239
2002
250
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00420-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm250.html#DankelmannRV02
2005-09-19
Recognizing Knödel graphs.
41-62
2002
250
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00270-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm250.html#CohenFG02
2005-09-19
Lower bounds of Ramsey numbers based on cubic residues.
197-209
2002
250
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00283-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm250.html#SuLLL02
2005-09-19
A counterexample to a conjecture of Erdõs.
231-232
2002
250
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00158-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm250.html#Biyikoglu02
2005-09-19
Rank, term rank, and chromatic number.
253-257
2002
250
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00422-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm250.html#FishkindK02
2005-09-19
Universal H-colorable graphs without a given configuration.
245-252
2002
250
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00421-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm250.html#DreyerMN02
2005-11-02
<i>k</i>-dependent domination.
83-94
2002
249
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00236-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm249.html#FavaronHHR02
2005-09-23
A note on fragile graphs.
41-43
2002
249
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00226-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm249.html#ChenY02
2005-09-23
Genus bounds for embeddings with large minimum degree and representativity.
167-178
2002
249
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00243-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm249.html#PlummerZ02
2006-05-23
Restricted list coloring and Hall's condition.
57-63
2002
249
Discrete Mathematics
1-3
http://dx.doi.org/
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm249.html#CropperG02
2005-09-23
Fault-tolerant locating-dominating sets.
179-189
2002
249
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00244-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm249.html#Slater02
2005-09-23
A Fibonacci tiling of the plane.
111-116
2002
249
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00239-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm249.html#HuegyW02
2005-09-23
<i>t</i>.
31-39
2002
249
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00225-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm249.html#BursteinCPS02
2005-09-23
On the half?half case of the Zarankiewicz problem.
95-104
2002
249
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00237-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm249.html#GriggsH02
2005-09-23
Arithmetic progressions of cycles in outer-planar graphs.
65-70
2002
249
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00234-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm249.html#Denley02
2005-09-23
Minimum average distance subsets in the hamming cube.
149-165
2002
249
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00242-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm249.html#Kundgen02
2005-09-23
The hamiltonicity of bipartite graphs involving neighborhood unions.
45-56
2002
249
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00227-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm249.html#ChenSWZ02
2006-02-13
Foreword.
1-
2002
249
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00223-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm249.html#KubickiL02
2005-09-23
Hall's condition for list-coloring, and the Hall parameters: recent developments.
135-147
2002
249
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00241-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm249.html#Johnson02
2005-09-23
Ramsey games.
3-30
2002
249
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00224-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm249.html#Beck02
2005-09-23
The Helly bound for singular sums.
117-133
2002
249
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00240-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm249.html#Jamison02
2005-09-23
Characterizing forbidden clawless triples implying hamiltonian graphs.
71-81
2002
249
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00235-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm249.html#FaudreeGJL02
2005-09-23
Two-edge colorings of graphs with bounded degree in both colors.
105-110
2002
249
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00238-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm249.html#GyoriS02
2005-09-23
The Lucas property of a number array.
157-168
2002
248
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00172-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm248.html#Razpet02
2005-09-23
Pseudocomplements of closure operators on posets.
143-155
2002
248
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00191-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm248.html#Ranzato02
2005-09-23
Total embedding distributions for bouquets of circles.
93-108
2002
248
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00187-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm248.html#KwakS02
2005-09-23
<i>q</i><i>q</i><sup>2</sup>) and Hermitian curves.
17-25
2002
248
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00182-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm248.html#CasseQ02
2005-09-23
Nonlinearity, local and global avalanche characteristics of balanced Boolean functions.
181-193
2002
248
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00193-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm248.html#Stanica02
2005-09-23
On the indecomposable partition problem: IPP(10, wedge).
255-264
2002
248
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00347-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm248.html#Eslami02
2006-10-26
Relations between squares and triangles.
245-247
2002
248
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00344-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm248.html#BarrucandCH02
2005-09-23
Random induced graphs.
249-254
2002
248
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00345-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm248.html#BollobasEFRS02
2005-09-23
Unavoidable minors of graphs of large type.
27-67
2002
248
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00184-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm248.html#DittmannO02
2005-09-23
Graph partition into paths containing specified vertices.
271-277
2002
248
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00349-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm248.html#Kawarabayashi02
2005-09-23
On the refined lecture hall theorem.
293-298
2002
248
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00352-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm248.html#Yee02
2005-09-23
Chain polynomials and Tutte polynomials.
279-282
2002
248
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00350-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm248.html#Traldi02
2005-09-23
Suprema and infima of association schemes.
1-16
2002
248
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00179-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm248.html#Bailey02
2005-09-23
Essential arities in algebras of finite type and arity trees.
79-91
2002
248
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00186-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm248.html#KisielewiczT02
2005-09-23
Disjoint subgraphs of large maximum degree.
125-141
2002
248
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00190-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm248.html#PikhurkoT02
2005-09-23
On vertex-transitive graphs of odd prime-power order.
265-269
2002
248
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00348-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm248.html#Feng02
2005-09-23
On structure of graphs embedded on surfaces of nonnegative characteristic with application to choosability.
283-291
2002
248
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00351-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm248.html#Xu02a
2005-09-23
Characterizing minimally 1-factorable r-regular bipartite graphs.
109-123
2002
248
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00189-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm248.html#Labbate02
2005-09-23
Binding number conditions for matching extension.
169-179
2002
248
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00192-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm248.html#RobertshawW02
2005-09-23
Concerning the maximum number of stable matchings in the stable marriage problem.
195-219
2002
248
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00194-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm248.html#Thurber02
2005-09-23
<i>t</i><sub>1</sub><i>t</i><sub>2</sub>-core.
237-243
2002
248
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00343-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm248.html#Anderson02
2005-09-23
Uniquely colorable mixed hypergraphs.
221-236
2002
248
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00176-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm248.html#TuzaVZ02
2005-09-23
<i>i</i>-excellent trees.
69-77
2002
248
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00274-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm248.html#HaynesH02
2005-09-26
On pebbling threshold functions for graph sequences.
93-105
2002
247
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00163-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm247.html#CzygrinowEHK02
2005-09-26
Tutte polynomial expansions for 2-separable graphs.
201-213
2002
247
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00177-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm247.html#Woodall02a
2005-09-26
<i>H</i><i>H</i>having lambda edges.
51-64
2002
247
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00181-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm247.html#CaroRS02
2005-09-26
<i>r</i><i>k</i>-complete bipartite bihypergraphs and generalized split graphs.
261-270
2002
247
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00318-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm247.html#Zverovich02
2005-09-26
Forbidden subgraph decomposition.
159-168
2002
247
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00173-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm247.html#RusuS02
2005-09-26
Orbit decomposition of subset actions.
251-254
2002
247
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00314-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm247.html#Smith02
2005-09-26
Resolvable perfect Mendelsohn designs with block size five.
1-12
2002
247
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00157-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm247.html#AbelBG02
2005-09-26
Transitive resolvable idempotent symmetric quasigroups and large sets of Kirkman triple systems.
215-223
2002
247
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00178-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm247.html#ZhangZ02
2005-09-26
Antimagic vertex labelings of hypergraphs.
187-199
2002
247
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00175-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm247.html#Sonntag02
2005-09-26
Descendants in highly arc transitive digraphs.
147-157
2002
247
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00171-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm247.html#Moller02
2005-09-26
Characterization of opaque automata.
65-78
2002
247
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00160-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm247.html#ChenY02a
2005-09-26
Ordered Ramsey numbers.
79-92
2002
247
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00161-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm247.html#ChoudumP02
2006-03-02
On the fractional chromatic number, the chromatic number, and graph products.
235-242
2002
247
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00312-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm247.html#KlavarY02
2005-09-26
Completing the spectrum of 2-chromatic S(2, 4, v).
225-228
2002
247
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00308-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm247.html#FranekGLR02
2005-09-26
Dense ellipsoid packings.
243-249
2002
247
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00313-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm247.html#Schurmann02
2005-09-26
<i>X</i>-tree.
169-186
2002
247
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00174-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm247.html#SempleS02
2005-09-26
<sub>4</sub>.
25-50
2002
247
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00159-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm247.html#BouyuklievaH02
2005-09-26
A family of universal pseudo-homogeneous G-colourable graphs.
13-23
2002
247
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00158-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm247.html#Bonato02
2005-09-26
<sub>4</sub>-linear codes.
135-145
2002
247
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00168-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm247.html#Jie02
2005-09-27
<i>k</i>-subdomination number of graphs.
229-234
2002
247
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00311-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm247.html#KangDCS02
2005-09-26
Rétractions, corétractions et enveloppe injective d'une algèbre de transitions.
117-134
2002
247
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00165-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm247.html#Hudry02
2005-09-26
Notes on Chvátal's conjecture.
255-259
2002
247
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00317-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm247.html#Wang02b
2005-09-26
On the Cayley isomorphism problem.
107-116
2002
247
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00164-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm247.html#Dobson02
2005-09-27
Path factors in claw-free graphs.
195-200
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00214-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#AndoEKKM02
2005-09-27
Factorizations of and by powers of complete graphs.
201-205
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00216-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#BryantEE02
2005-09-27
On formal products and angle matrices of a graph.
151-160
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00055-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#Lepovic02
2005-09-27
On elements in small cocircuits in minimally k-connected graphs and matroids.
273-282
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00220-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#ReidW02
2005-09-27
Resolvable group divisible designs with block size four.
109-119
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00460-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#Ge02
2005-09-27
Neighborhood intersections and Hamiltonicity in almost claw-free graphs.
171-185
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00469-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#Zhan02
2005-09-27
On planar and dismantlable lattices.
207-211
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00207-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#Collins02
2005-09-27
New constructions of non-adaptive and error-tolerance pooling designs.
161-170
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00465-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#NgoD02
2005-09-27
Diameter series of lattice covering simplices.
235-239
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00201-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#ForcadeL02
2005-09-27
Two discrete?non-discrete results.
223-228
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00210-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#DulioS02
2005-09-27
On orthogonal orthomorphisms of cyclic and non-abelian groups.
229-233
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00211-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#Evans02
2005-09-27
<i>G</i>-linear codes.
187-194
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00206-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#AlvesGPCIA02
2005-09-27
<i><sub>n</sub></i><i>E</i><i><sub>r</sub></i>).
241-252
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00218-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#HeYMXSW02
2005-09-27
List decomposition of graphs.
67-77
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00051-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#CaroY02
2005-09-27
Counterexamples against some families of chromatically unique graphs.
257-258
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00203-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#LiF02
2005-09-27
Trees in tournaments.
121-134
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00463-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#Havet02
2005-09-27
On dijoins.
213-216
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00209-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#CornuejolsG02
2005-09-27
MV-algebras in duality with labelled root systems.
79-90
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00052-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#NolaG02
2005-09-27
The enumeration of near-perfect matchings of factor-critical graphs.
259-266
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00204-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#LiuH02
2005-09-27
Spherical codes and Borsuk's conjecture.
253-256
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00202-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#Hinrichs02
2005-09-27
A note on the chromaticity of some 2-connected (n, n+3)-graphs.
217-221
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00217-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#DongTK02
2005-09-27
Maximal partial spreads and the modular n-queen problem III.
135-150
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00464-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#Heden02a
2005-09-27
The three-way intersection problem for latin squares.
1-19
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00454-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#AdamsBBM02
2005-09-27
Forbidden subgraphs that imply k-ordered and k-ordered hamiltonian.
91-108
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00458-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#FaudreeF02
2005-09-27
On restricted edge-connectivity of graphs.
291-298
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00232-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#XuX02
2005-09-27
A further extension of Yap's construction for ?-critical graphs.
283-290
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00230-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#Song02
2005-09-27
The Tutte polynomial for homeomorphism classes of graphs.
267-272
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00042-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#ReadW02
2005-09-27
Fibrations of graphs.
21-66
2002
243
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00455-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm243.html#BoldiV02
2005-09-27
Polyhedral graphs with restricted number of faces of the same type.
473-478
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00103-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#VoigtW02
2005-09-27
Matchings and Hadwiger's Conjecture.
241-252
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00087-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#Kotlov02
2005-09-27
Classifying 2-arc-transitive graphs of order a product of two primes.
331-338
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00062-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#MarusicP02
2005-09-27
Nesting points in the sphere.
5-16
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00072-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#ArchdeaconS02
2005-09-27
A polynomial time algorithm for determining zero Euler-Petrie genus of an Eulerian graph.
445-454
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00100-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#ServatiusS02
2005-09-27
Skew-morphisms of regular Cayley maps.
167-179
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00081-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#JajcayS02
2005-09-27
A self-similarity structure generated by king's walk.
423-433
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00098-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#Razpet02a
2005-09-27
Re-embedding structures of 5-connected projective-planar graphs.
211-221
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00084-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#KitakuboN02
2005-09-27
Modelling finite geometries on surfaces.
479-493
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00069-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#White02
2005-09-27
Letter graphs and well-quasi-order by induced subgraphs.
375-388
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00094-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#Petkovsek02
2005-09-27
On isometric subgraphs of infinite bridged graphs and geodesic convexity.
399-416
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00097-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#Polat02
2005-09-27
The relation graph.
153-166
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00080-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#HuberM02
2005-09-27
Association schemes generated by a non-symmetric relation of valency 2.
109-135
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00063-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#HirasakaM02
2005-09-27
Embedding partial bipartite directed cycle systems.
269-278
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00089-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#LindnerM02
2005-09-27
Cyclic Haar graphs.
137-152
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00064-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#HladnikMP02
2005-09-27
The exact isoperimetric inequality for ternary and quaternary cubes.
455-460
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00101-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#Slivnik02
2005-09-27
On quasiabelian Cayley graphs and graphical doubly regular representations.
495-519
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00104-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#Zgrablic02
2005-09-27
On 2-arc-transitive Cayley graphs of Abelian groups.
417-421
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00068-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#Potocnik02
2005-09-27
Choice number of some complete multi-partite graphs.
55-66
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00059-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#EnomotoOOS02
2005-09-27
A new technique for the characterization of graphs with a maximum number of spanning trees.
351-373
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00095-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#PetingiR02
2005-09-27
On approximating the maximum diameter ratio of graphs.
323-330
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00091-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#MarincekM02
2005-09-27
A note on degree conditions for hamiltonicity in 2-connected claw-free graphs.
253-268
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00088-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#KovarikMR02
2005-09-27
Bipartizing matchings and Sabidussi's compatibility conjecture.
77-82
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00076-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#Fleischner02
2005-09-27
Towards a characterisation of Pfaffian near bipartite graphs.
279-297
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00060-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#LittleRF02
2005-09-27
Homomorphisms to powers of digraphs.
31-41
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00073-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#BrewsterH02
2005-09-27
Special numbers of crossings for complete graphs.
95-102
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00078-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#Harborth02
2005-09-27
Novel highly symmetrical trivalent graphs which lead to negative curvature carbon and boron nitride chemical structures.
203-210
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00067-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#King02
2005-09-27
Generating triangulations on closed surfaces with minimum degree at least 4.
345-349
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00093-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#NakamotoN02
2005-09-27
Finding a five bicolouring of a triangle-free subgraph of the triangular lattice.
103-108
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00079-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#HavetZ02
2005-09-27
On cubic Cayley graphs of finite simple groups.
67-75
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00075-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#FangLWX02
2005-09-27
Krein parameters and antipodal tight graphs with diameter 3 and 4.
181-202
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00082-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#JurisicK02
2005-09-27
Unique square property and fundamental factorizations of graph bundles.
551-561
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00106-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#ZmazekZ02
2005-09-27
Regular packings of regular graphs.
83-94
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00065-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#GutierrezL02
2005-09-27
The direct expansion of graphs.
17-30
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00066-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#Bresar02
2005-09-27
Plane graphs with Eulerian Petrie walks.
539-549
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00061-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#Zitnik02
2005-09-27
Preface.
1-4
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00246-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#KlavzarMM02
2005-09-27
Spanning graphs of hypercubes: starlike and double starlike trees.
231-239
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00086-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#KobeissiM02
2005-09-27
Isometric embedding of mosaics into cubic lattices.
43-53
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00074-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#DezaS02
2005-09-27
The level of nonmultiplicativity of graphs.
461-471
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00102-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#TardifZ02a
2005-09-27
On subgraphs of Cartesian product graphs.
223-230
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00085-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#KlavzarLP02
2005-09-27
Strongly adjacency-transitive graphs and uniquely shift-transitive graphs.
389-398
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00096-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#PisanskiTZ02
2005-09-27
Imprimitive symmetric graphs, 3-arc graphs and 1-designs.
521-537
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00105-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#Zhou02
2005-09-27
Action graphs and coverings.
299-322
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00090-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#Malnic02
2005-09-27
<i>K</i><sub>n</sub><i>I</i>into cycles of a fixed odd length.
435-444
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00099-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#Sajna02
2005-09-27
Coloring Eulerian triangulations of the projective plane.
339-343
2002
244
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00092-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm244.html#Mohar02
2005-09-28
On clique divergent graphs with linear growth.
139-153
2002
245
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00138-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm245.html#LarrionN02
2005-09-28
Orthogonal factorizations of graphs.
173-194
2002
245
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00140-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm245.html#LiCY02
2005-09-28
New (100, 45, 20) symmetric designs and Bush-type Hadamard matrices of order 100.
263-272
2002
245
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00309-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm245.html#GolemacV02
2005-09-28
Well-graded spaces of valued sets.
217-233
2002
245
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00143-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm245.html#Ovchinnikov02
2005-09-28
Irreducible elements and uniquely generated algebras.
63-79
2002
245
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00364-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm245.html#BermanB02
2005-09-28
The minimum forcing number for the torus and hypercube.
283-292
2002
245
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00228-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm245.html#Riddle02
2005-09-28
On the recognition of de Bruijn graphs and their induced subgraphs.
81-92
2002
245
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00133-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm245.html#BlazewiczFKK02
2005-09-28
On a question concerning prime distance graphs.
293-298
2002
245
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00221-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm245.html#Yegnanarayanan02
2005-09-28
Non-chordal graphs having integral-root chromatic polynomials II.
247-253
2002
245
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00307-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm245.html#DongTKH02
2005-09-28
<sub>2</sub><sub>2</sub>.
203-216
2002
245
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00142-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm245.html#MalnicM02
2005-09-28
On hamiltonian Toeplitz graphs.
107-125
2002
245
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00136-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm245.html#Heuberger02
2005-09-28
An extension of a theorem on cycles containing specified independent edges.
127-137
2002
245
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00137-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm245.html#IshigamiW02
2005-09-28
Polynomial algorithms for nested univariate clustering.
93-105
2002
245
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00135-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm245.html#HansenJS02
2005-09-28
<sub>1, 4</sub><sub>1, 4</sub><i>e</i>}-free graphs.
195-202
2002
245
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00141-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm245.html#LiS02
2005-09-28
Cycles in multipartite tournaments: results and problems.
19-53
2002
245
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00419-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm245.html#Volkmann02a
2005-09-28
On the diameter of the rotation graph of binary coupling trees.
1-18
2002
245
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00418-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm245.html#FackLJ02
2005-09-28
Star forests, dominating sets and Ramsey-type problems.
255-262
2002
245
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00046-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm245.html#FerneyhoughHHM02
2005-09-28
Distance monotonicity and a new characterization of hypercubes.
55-62
2002
245
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00132-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm245.html#AiderA02
2005-09-28
<sub>4</sub>-codes and Hadamard matrices.
273-278
2002
245
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00310-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm245.html#Harada02
2005-09-28
The circular chromatic number of series-parallel graphs of large odd girth.
235-246
2002
245
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00144-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm245.html#PanZ02a
2005-09-28
The geometry of regular trees with the Faber?Krahn property.
155-172
2002
245
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00139-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm245.html#Leydold02
2005-09-28
On Kelly's lemma for infinite sets of integers.
279-282
2002
245
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00219-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm245.html#Rautenbach02a
2005-09-28
Specializations of MacMahon symmetric functions and the polynomial algebra.
285-293
2002
246
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00263-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm246.html#Rosas02
2005-09-28
Extended pattern avoidance.
219-230
2002
246
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00259-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm246.html#Linusson02
2005-09-28
Stirling numbers interpolation using permutations with forbidden subsequences.
177-195
2002
246
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00257-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm246.html#LabelleLPP02
2005-09-28
A geometric version of the Robinson-Schensted correspondence for skew oscillating tableaux.
67-81
2002
246
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00252-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm246.html#ChauveD02
2005-09-28
Color-to-spin ribbon Schensted algorithms.
295-316
2002
246
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00264-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm246.html#ShimozonoW02
2005-09-28
The first term in the expansion of plethysm of Schur functions.
331-341
2002
246
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00266-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm246.html#Yang02
2005-09-28
Algebraic characterizations of distance-regular graphs.
111-129
2002
246
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00255-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm246.html#Fiol02
2005-09-28
Transitive factorizations of free partially commutative monoids and Lie algebras.
83-97
2002
246
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00253-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm246.html#DuchampL02
2005-10-31
On generating functions for subalgebras of free Lie superalgebras.
269-284
2002
246
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00262-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm246.html#Petrogradsky02
2005-09-28
Finite locally-quasiprimitive graphs.
197-218
2002
246
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00258-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm246.html#LiPVZ02
2005-09-28
Shifted quasi-symmetric functions and the Hopf algebra of peak functions.
57-66
2002
246
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00251-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm246.html#BergeronMSW02
2005-09-28
Generating functions for generating trees.
29-55
2002
246
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00250-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm246.html#BanderierBDFGG02
2005-09-28
A Strahler bijection between Dyck paths and planar trees.
317-329
2002
246
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00265-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm246.html#Viennot02
2005-09-28
Hilbert functions of ladder determinantal varieties.
131-175
2002
246
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00256-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm246.html#Ghorpade02
2005-09-28
Counting 1-vertex triangulations of oriented surfaces.
13-27
2002
246
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00249-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm246.html#BacherV02
2005-09-28
Génération de chemins de Dyck à pics croissants.
255-267
2002
246
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00261-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm246.html#PenaudR02a
2005-09-28
Yangians and transvector algebras.
231-253
2002
246
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00260-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm246.html#Molev02
2005-09-28
<i>q</i>-enumeration of directed diagonally convex polyominoes.
99-109
2002
246
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00254-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm246.html#Feretic02
2005-09-28
Foreword.
1-
2002
246
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00247-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm246.html#CoriN02
2005-09-28
Matrix integrals and the counting of tangles and links.
343-360
2002
246
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00267-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm246.html#Zinn-JustinZ02
2005-09-28
<i>q</i>-difference systems.
3-12
2002
246
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00248-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm246.html#Abramov02
2005-09-28
On matroid intersection adjacency.
277-281
2002
242
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00167-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm242.html#Iwata02
2005-09-28
Upper bounds for domination numbers of the queen's graph.
229-243
2002
242
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00467-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm242.html#Weakley02
2005-09-28
Constructions for mutually orthogonal frequency hyperrectangles with a prescribed type.
55-64
2002
242
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00457-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm242.html#ChengM02
2005-09-28
Almost distance-hereditary graphs.
1-16
2002
242
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00401-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm242.html#Aider02
2005-09-28
Image partition regular matrices--bounded solutions and preservation of largeness.
115-144
2002
242
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00276-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm242.html#HindmanLS02
2005-09-28
No starlike trees are cospectral.
291-295
2002
242
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00169-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm242.html#LepovicG02
2005-09-28
Edge clique graphs and some classes of chordal graphs.
31-39
2002
242
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00403-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm242.html#CerioliS02
2005-09-28
Hamiltonicity, neighborhood intersections and the partially square graphs.
245-254
2002
242
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00394-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm242.html#WuZZ02
2005-09-28
<i>u</i>(3, 3, 3).
103-113
2002
242
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00369-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm242.html#HenningO02
2005-09-28
An example related to the best code of reconstructing the cells of a partition design from its adjacency matrix.
269-276
2002
242
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00319-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm242.html#Canogar02
2005-09-28
Degree sums and subpancyclicity in line graphs.
255-267
2002
242
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00468-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm242.html#XiongBHL02
2005-09-28
On chromatic roots of large subdivisions of graphs.
17-30
2002
242
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00402-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm242.html#BrownH02
2005-09-28
<i>p</i>}.
175-185
2002
242
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00466-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm242.html#OxleySVW02
2005-09-28
Characterization of graphs with equal bandwidth and cyclic bandwidth.
283-289
2002
242
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00379-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm242.html#LamSC02
2005-09-28
Enumeration of simple bipartite maps on the sphere and the projective plane.
187-200
2002
242
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00462-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm242.html#RenL02
2005-09-28
<i>c</i><i>c</i>geq5 are vertex pancyclic.
201-228
2002
242
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00212-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm242.html#TewesVY02
2005-09-28
Trees with equal domination and tree-free domination numbers.
93-102
2002
242
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00053-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm242.html#HaynesH02a
2005-09-28
A branch-and-cut approach for minimum cost multi-level network design.
65-92
2002
242
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00404-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm242.html#ChopraT02
2005-09-28
On the divisibility of graphs.
145-156
2002
242
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00054-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm242.html#HoangM02
2005-09-28
The Steiner number of a graph.
41-54
2002
242
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00456-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm242.html#ChartrandZ02
2005-09-28
Endomorphism monoids of chained graphs.
157-174
2002
242
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00405-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm242.html#KoubekS02
2005-09-28
A set intersection theorem and an application to a bipartite Ramsey theorem.
297-298
2002
242
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00170-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm242.html#Ramras02
2005-09-29
Graphs with many large degrees.
171-177
2001
239
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00049-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm239.html#Soffer01
2005-09-29
<i>n</i>).
109-120
2001
239
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00040-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm239.html#BrownV01
2005-09-29
The sum number and integral sum number of complete bipartite graphs.
69-82
2001
239
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00195-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm239.html#WangL01
2005-09-29
<i>K</i><sub>r, s</sub>.
137-146
2001
239
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00172-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm239.html#HeSWCKY01
2005-09-29
Integer multiflows and metric packings beyond the cut condition.
13-31
2001
239
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00372-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm239.html#MarcusS01
2005-09-29
An extremal ternary self-dual [28, 14, 9] code with a trivial automorphism group.
121-125
2001
239
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00041-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm239.html#Harada01
2005-09-29
Enumeration of binary orthogonal arrays of strength 1.
191-198
2001
239
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00045-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm239.html#ZhangYL01
2005-09-29
<i>P</i><sub>4</sub>-indifferent graphs.
161-169
2001
239
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00050-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm239.html#Rizzi01
2005-09-29
On signed edge domination numbers of graphs.
179-189
2001
239
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00044-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm239.html#Xu01
2005-09-29
On majority domination in graphs.
1-12
2001
239
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00370-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm239.html#Holm01
2005-09-29
A combinatorial derivation of the Poincare' polynomials of the finite irreducible Coxeter groups.
83-99
2001
239
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00375-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm239.html#Winkel01
2005-09-29
Realizing degree imbalances in directed graphs.
147-153
2001
239
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00048-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm239.html#MubayiWW01
2005-09-29
Separating 3-cycles in plane triangulations.
127-136
2001
239
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00047-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm239.html#HarantHS01
2005-09-29
Countable alpha-extendable graphs.
53-67
2001
239
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00374-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm239.html#RulliereT01
2005-09-29
New formula for the sum number for the complete bipartite graphs.
155-160
2001
239
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00188-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm239.html#Pyatkin01
2005-09-29
Generalizations of some Ramsey-type theorems for matchings.
101-107
2001
239
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00157-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm239.html#BialostockiV01
2005-09-29
Recursively defined combinatorial functions: extending Galton's board.
33-51
2001
239
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00373-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm239.html#Neuwirth01
2005-09-29
Bounds on codes over an alphabet of five elements.
13-19
2001
240
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00383-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm240.html#BogdanovaO01
2005-09-29
<i>t</i>-designs.
197-204
2001
240
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00392-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm240.html#Sebille01
2005-09-29
On Mills's conjecture on matroids with many common bases.
271-276
2001
240
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00199-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm240.html#Lemos01
2005-09-29
Graphs whose acyclic graphoidal covering number is one less than its maximum degree.
231-237
2001
240
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00350-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm240.html#ArumugamRP01
2005-09-29
An infinite family of 7-designs.
1-11
2001
240
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00382-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm240.html#Bierbrauer01
2005-09-29
Choosability conjectures and multicircuits.
123-143
2001
240
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00371-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm240.html#KostochkaW01
2005-09-29
VIP systems in partial semigroups.
45-70
2001
240
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00385-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm240.html#HindmanM01
2005-09-29
Segments in a planar nearring.
205-217
2001
240
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00393-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm240.html#Sun01
2005-09-29
Loopless generation of up-down permutations.
97-122
2001
240
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00387-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm240.html#Korsh01
2005-09-29
Some flow-equivalent planar and non-planar graphs.
277-280
2001
240
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00056-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm240.html#Shahmohamad01
2005-09-29
A proof of Hougardy's conjecture for diamond-free graphs.
83-95
2001
240
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00113-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm240.html#KezdyS01
2006-05-23
Covering hypercubes by isometric paths.
253-260
2001
240
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00197-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm240.html#FitzpatrickNHC01
2005-09-29
Block graphs with unique minimum dominating sets.
247-251
2001
240
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00196-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm240.html#Fischermann01
2005-09-29
Additive multiplicative increasing functions on nonnegative square matrices and multidigraphs.
21-43
2001
240
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00384-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm240.html#ChangCH01
2005-09-29
Maximal IM-unextendable graphs.
295-298
2001
240
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00205-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm240.html#WangY01
2005-09-29
<i>n</i>-factor-critical graphs.
71-82
2001
240
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00386-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm240.html#KawarabayashiOS01
2005-09-29
On the primitive idempotents of distance-regular graphs.
281-294
2001
240
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00200-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm240.html#Tomiyama01
2005-09-29
Diagonal flips in pseudo-triangulations on closed surfaces.
187-196
2001
240
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00391-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm240.html#Negami01
2005-09-29
Circulant digraphs determined by their spectra.
261-270
2001
240
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00198-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm240.html#HuangC01
2005-09-29
Some results on integral sum graphs.
219-229
2001
240
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00118-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm240.html#YanL01
2005-09-29
Bounds on the number of isolates in sum graph labeling.
175-185
2001
240
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00390-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm240.html#NagamochiMS01
2005-09-29
Colouring Steiner systems with specified block colour patterns.
145-160
2001
240
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00388-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm240.html#MiliciRV01
2005-09-29
Factorizations of root-based polynomial compositions.
161-173
2001
240
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00389-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm240.html#Mills01
2005-09-29
Multicolored forests in complete bipartite graphs.
239-245
2001
240
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00159-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm240.html#BrualdiH01
2005-09-29
A survey of the Fine numbers.
241-265
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00121-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#DeutschS01
2005-09-29
A note on equal unions in families of sets.
387-393
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00124-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#JacobsJ01
2005-09-29
On deleting coordinates from integer vectors.
201-206
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00148-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#Daykin01
2005-09-29
Tricolore 3-designs in Type III codes.
129-138
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00114-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#BonnecazeSU01
2005-09-29
Bounds on identifying codes.
119-128
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00113-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#BlassHL01
2005-09-29
A combinatorial proof of the duality defect conjecture in codimension 2.
363-378
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00154-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#Holme01
2005-09-29
Helge Tverberg A celebration of a life in mathematics.
1-6
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00304-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#Rogers01
2005-09-29
On the second greedy weight for linear codes of dimension 3.
171-187
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00116-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#ChenK01
2005-09-29
A pairing of the vertices of ordered trees.
471-477
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00130-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#Seo01
2005-09-29
Median and center hyperplanes in Minkowski spaces--a unified approach.
407-426
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00126-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#MartiniS01
2005-09-29
Sorting a bridge hand.
289-300
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00150-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#ErikssonEKSW01
2005-09-29
On the bit oriented trellis structure of run length limited codes on discrete local data dependent channels.
51-63
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00109-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#BarberoY01
2005-09-29
Relations among the fractional chromatic, choice, Hall, and Hall-condition numbers of simple graphs.
189-199
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00117-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#DaneshgarHJ01
2005-09-29
Determination of convex bodies by certain sets of sectional volumes.
79-96
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00111-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#BarkerL01
2005-09-29
On periodically-cyclic Gale 4-polytopes.
103-118
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00112-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#BisztriczkyB01
2005-09-29
On the self matching properties of [j tau].
139-151
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00147-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#BunderT01
2005-09-29
The Overfull Conjecture and the Conformability Conjecture.
343-361
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00153-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#HiltonHZ01
2005-09-29
On subplanes of free planes.
379-385
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00155-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#Iden01
2005-09-29
Reconstruction of lattice sets from their horizontal, vertical and diagonal X-rays.
65-78
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00110-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#BarcucciBLN01
2005-09-29
Two bijections for the area of Dyck paths.
435-447
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00129-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#Pergola01
2005-09-29
The triples of geometric permutations for families of disjoint translates.
23-32
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00107-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#AsinowskiHK01
2005-09-29
<sup>3</sup>.
267-288
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00149-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#Eckhoff01
2005-09-29
Sylvester-type theorems for unit circles.
97-101
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00146-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#BezdekFT01
2005-09-29
Zonotopes associated with higher Bruhat orders.
301-312
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00127-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#FelsnerZ01
2005-09-29
On the existence of a point subset with a specified number of interior points.
33-40
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00108-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#AvisHU01
2005-09-29
A combinatorial mathematician in Norway: some personal reflections.
11-22
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00222-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#Tverberg01
2005-09-29
<sub>4</sub>via an Assmus-Mattson type approach.
479-487
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00156-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#ShinKH01
2005-09-29
Upper bounds on weight hierarchies of extremal non-chain codes.
449-469
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00131-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#Schaathun01
2005-09-29
On the lattice diameter of a convex polygon.
41-50
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00145-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#BaranyF01
2005-09-29
Convexification of polygons by flips and by flipturns.
333-342
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00152-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#GrunbaumZ01
2005-09-29
A bijective proof of the equation linking the Schro"der numbers, large and small.
235-240
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00122-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#Deutsch01
2005-09-29
Isohedra with dart-shaped faces.
313-332
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00151-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#GrunbaumS01
2005-09-29
<i>h</i><sup>n</sup>+1.
395-406
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00125-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#KirfelR01
2005-09-29
Graph homotopy and Graham homotopy.
153-170
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00115-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#ChenYY01
2005-09-29
Notes on the topological Tverberg theorem.
207-233
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00118-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#Longueville01
2005-09-29
Separating convex sets by straight lines.
427-433
2001
241
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(01)00128-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm241.html#PachT01
2005-10-13
<i>r</i>-orthogonal latin squares.
183-191
2001
238
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00424-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm238.html#LieZ01
2005-10-13
Some new Hadamard designs with 79 points admitting automorphisms of order 13 and 19.
61-65
2001
238
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00415-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm238.html#HeldP01
2005-10-13
Some observations on three classical BIBD constructions.
19-26
2001
238
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00408-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm238.html#BurattiZ01
2005-10-13
Some new extremal self-dual codes with lengths 42, 44, 52, and 58.
147-150
2001
238
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00420-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm238.html#ZhangL01
2005-10-13
Bounds and constructions for TWOOAs.
137-145
2001
238
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00423-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm238.html#WuZ01
2005-10-13
<i>q</i>).
131-136
2001
238
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00416-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm238.html#Prince01
2005-10-13
The nonexistence of some quaternary linear codes of dimension 5.
99-113
2001
238
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00413-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm238.html#Maruta01
2005-10-13
Vanishing conditions on parameters for P(Q)-polynomial association schemes.
53-60
2001
238
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00409-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm238.html#GaoY01
2005-10-13
Four-dimensional football, fullerenes and diagram geometry.
115-130
2001
238
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00414-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm238.html#Pasini01
2005-10-13
Orthogonal arrays obtained by generalized Hadamard product.
151-170
2001
238
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00421-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm238.html#ZhangPW01
2005-10-13
The spectrum for large set of disjoint incomplete Latin squares.
89-98
2001
238
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00410-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm238.html#LeiKC01
2006-07-24
Covers and blocking sets of classical generalized quadrangles.
35-51
2001
238
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00418-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm238.html#EisfeldSSS01
2005-10-13
Directed packing and covering designs with block size four.
3-17
2001
238
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00419-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm238.html#AssafSY01
2005-10-13
<i>t</i><i>Z</i><sub>4</sub>.
67-80
2001
238
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00417-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm238.html#HellesethRY01
2005-10-13
A unified method to construct neural network decoders for arbitrary codes and decoding rules.
171-181
2001
238
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00422-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm238.html#ZhangMY01
2005-10-13
Preface.
1-
2001
238
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00407-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm238.html#ColbournS01
2005-10-31
On strong 1-factors and Hamilton weights of cubic graphs.
143-148
2001
230
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00077-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm230.html#Zhang01
2005-10-13
Weight hierarchies of binary linear codes of dimension 4.
27-34
2001
238
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00411-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm238.html#ChenK01a
2005-10-13
Some more remarks on domination in cubic graphs.
193-197
2001
237
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00348-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm237.html#WangM01
2005-10-13
Some remarks on Davenport constant.
119-128
2001
237
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00365-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm237.html#DelormeOQ01
2005-10-14
Matching 2-lattice polyhedra: finding a maximum vector.
29-61
2001
237
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00219-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm237.html#ChangLV01
2005-10-13
Tree width and regular triangulations.
187-191
2001
237
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00102-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm237.html#Kotlov01
2005-10-13
Triangulations and a generalization of Bose's method.
97-107
2001
237
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00363-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm237.html#ColbournS01a
2005-10-13
<i>t</i>-designs.
185-186
2001
237
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00059-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm237.html#Chee01
2005-10-13
The cyclic structure of unimodal permutations.
149-161
2001
237
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00368-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm237.html#Gannon01
2005-10-13
Two-lattice polyhedra: duality and extreme points.
63-95
2001
237
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00220-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm237.html#ChangLV01a
2005-10-13
Partial Hamming graphs and expansion procedures.
13-27
2001
237
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00362-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm237.html#Bresar01
2005-10-13
A duality between small-face problems in arrangements of lines and Heilbronn-type problems.
1-12
2001
237
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00360-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm237.html#Barequet01
2005-10-13
Covering a graph with cuts of minimum total size.
129-148
2001
237
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00367-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm237.html#FurediK01
2005-10-13
<i>R</i><i>m</i>).
163-184
2001
237
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00221-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm237.html#Hou01
2005-10-13
Some new symmetric designs with parameters (64, 28, 12).
109-118
2001
237
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00364-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm237.html#CrnkovicP01
2005-10-13
Voltage graphs, weight systems and odd symmetry.
287-313
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00449-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#Plachta01
2005-10-13
On graphs with a local hereditary property.
53-58
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00430-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#BorowieckiM01
2005-10-13
<i>C</i><sub>4</sub><i>K</i><sub>5</sub>is 13.
43-51
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00429-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#BielakG01
2005-10-13
New classes of perfectly orderable graphs.
95-109
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00434-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#FouquetRRT01
2005-10-13
Minimal reducible bounds for the class of k-degenerate graphs.
273-279
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00447-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#Mihok01
2005-10-13
Clique covering and degree conditions for hamiltonicity in claw-free graphs.
65-80
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00432-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#FavaronFLR01
2005-10-13
Presentations of groups generated by transpositions.
59-64
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00431-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#Delorme01
2005-10-13
The smallest hard-to-color graph for algorithm DSATUR.
151-165
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00439-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#JanczewskiKMP01
2005-10-13
On minimal Folkman graphs.
245-262
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00445-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#LuczakRU01
2005-10-13
Consecutive colorings of the edges of general graphs.
131-143
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00437-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#GiaroKM01
2005-10-13
Cyclability and pancyclability in bipartite graphs.
3-11
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00425-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#AbderrezzakFA01
2005-10-13
Eulerian iterated line graphs and digraphs.
315-323
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00450-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#Prisner01
2005-10-13
Plane integral drawings of planar graphs.
191-195
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00442-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#KemnitzH01
2005-10-13
The minimum size of fully irregular oriented graphs.
263-272
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00446-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#MajcherMGS01
2005-10-13
<i>d</i>-grids.
145-149
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00438-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#HarborthT01
2005-10-13
On the packing of three graphs.
197-225
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00443-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#KheddouciMSW01
2005-10-13
On the structure of ?-stable graphs.
227-243
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00444-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#LevitM01
2005-10-13
Inflated graphs with equal independence number and upper irredundance number.
81-94
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00433-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#Favaron01
2005-10-13
Claw-free graphs with complete closure.
325-338
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00451-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#RyjacekSS01
2005-10-13
Nonhamiltonian 2-connected claw-free graphs with large 4-degree sum.
123-130
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00436-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#Frydrych01
2005-10-13
The nonregular, bipartite, integral graphs with maximum degree 4. Part I: basic properties.
13-24
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00426-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#BalinskaS01
2005-10-13
Local structures in plane maps and distance colourings.
167-177
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00440-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#JendrolS01
2005-10-13
Self-complementary factors of almost complete tripartite graphs of even order.
111-122
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00435-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#Froncek01
2005-10-13
A note on the vertex-distinguishing proper coloring of graphs with large minimum degree.
37-42
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00428-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#BazganHLW01
2005-10-13
On the sum number and integral sum number of hypertrees and complete hypergraphs.
339-349
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00452-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#SonntagT01
2005-10-13
Path numbers of balanced bipartite tournaments.
281-285
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00448-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#Petrovic01
2005-10-13
Subforests of bipartite digraphs -- the minimum degree condition.
351-365
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00453-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#Ziolo01
2005-10-13
<i>P</i><sub>5</sub>-free minimal imperfect graphs.
25-36
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00427-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#BarreF01
2005-10-13
Preface.
1-
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00341-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#KalinowskiMMW01
2005-10-13
On a solution of a randomized three tracks variant of the Gate Matrix Layout problem.
179-189
2001
236
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00441-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm236.html#KaronskiS01
2005-10-13
On transformations of posets which have the same bound graph.
215-220
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00274-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#EraOT01
2005-10-13
The limit checker number of a graph.
343-347
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00292-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#SamalV01
2005-10-14
The hardness of intervalizing four colored caterpillars.
19-27
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00257-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#AlvarezDS01
2005-10-13
<i>K</i><sub>16</sub>.
165-171
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00270-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#Laywine01
2005-10-13
Vojtech Jarni'k's work in combinatorial optimization.
1-17
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00256-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#KorteN01
2005-10-13
Using simulated annealing to construct extremal graphs.
125-135
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00265-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#WangDM01
2005-10-13
A note on a triangle-free -- complete graph induced Ramsey number.
159-163
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00269-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#Gorgol01
2005-10-13
Optimal shadows and ideals in submatrix orders.
173-187
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00271-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#Leck01
2005-10-13
3-colourability of Penrose kite-and-dart tilings.
137-143
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00266-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#Babilon01
2005-10-13
The set of geodesics in a graph.
323-326
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00285-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#Nebesky01
2005-10-13
Heredity properties of connectedness in edge-coloured complete graphs.
301-306
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00282-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#IdzikT01
2005-10-13
Hosoya polynomial of composite graphs.
237-244
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00277-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#Stevanovic01
2005-10-13
Two-closure of odd permutation group in polynomial time.
221-232
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00275-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#EvdokimovP01
2005-10-13
Thomason's algorithm for finding a second hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs.
69-77
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00260-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#Cameron01
2005-10-13
Contact graphs of line segments are NP-complete.
95-106
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00263-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#Hlineny01
2005-10-13
Relative capacity and dimension of graphs.
307-315
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00283-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#KornerM01
2005-10-13
On the number of graphs and h-hypergraphs with bounded diameter.
291-299
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00281-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#Tomescu01
2005-10-13
<i>p</i><i>F</i><sub>p</sub>.
199-213
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00273-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#EliahouK01
2005-10-13
The asymptotic number of triple systems not containing a fixed one.
271-290
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00280-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#NagleR01
2005-10-13
A note on homomorphism-independent families.
327-334
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00286-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#NesetrilP01
2005-10-13
A numerical approach to long cycles in graphs and digraphs.
233-236
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00276-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#Fiedler01
2005-10-13
Proof of the Alon-Yuster conjecture.
255-269
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00279-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#KomlosSS01
2005-10-13
All-to-all wavelength-routing in all-optical compound networks.
353-363
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00289-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#AmarRT01
2005-10-13
Excluded minors for Boolean polymatroids.
317-321
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00284-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#Matus01
2005-10-13
Hamming distances of groups and quasi-groups.
189-197
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00272-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#Drapal01
2005-10-13
Nakade -- a graph theoretic concept in Go.
385-397
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00291-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#Nakamigawa01
2005-10-13
A lower bound on the chromatic number of Mycielski graphs.
79-86
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00261-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#CaramiaD01
2005-10-13
Local improving algorithms for large cuts in graphs with maximum degree three.
53-67
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00259-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#Bylka01
2005-10-13
<i>n</i><sup>2</sup>) algorithm to color Meyniel graphs.
107-123
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00264-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#RousselR01
2005-10-13
Novel matrix descriptor for determination of the connectivity of secondary structure segments in proteins. Analysis of general properties using graph theory.
399-423
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00293-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#PancoskaJN01
2005-10-13
Computational complexity of covering cyclic graphs.
87-94
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00262-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#Fiala01
2005-10-13
On the nonexistence of three-dimensional tiling in the Lee metric II.
151-157
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00268-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#GravierMP01
2005-10-13
<i>P</i><sub>4</sub>'s.
29-51
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00258-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#BabelKKKMO01
2005-10-13
Periodicity of graph operators.
349-351
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00288-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#Zelinka01
2005-10-13
Graph reconstruction from subgraphs.
335-341
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00287-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#Nydl01
2005-10-13
Application of hypergraph theory in chemistry.
365-383
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00290-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#KonstantinovaS01
2005-10-13
An intersection theorem for weighted sets.
145-150
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00267-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#Bey01
2005-10-13
Approximating layout problems on random graphs.
245-253
2001
235
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00278-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm235.html#DiazPST01
2005-10-13
Some permutations with forbidden subsequences and their inversion number.
1-15
2001
234
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00359-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm234.html#BarcucciLPP01
2005-10-13
Pancyclicity of the prism.
139-142
2001
234
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00397-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm234.html#GoddardH01
2005-10-13
On circulant chromatic number and circulant chromatic function.
101-118
2001
234
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00196-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm234.html#WangZ01
2005-10-13
Completely independent spanning trees in the underlying graph of a line digraph.
149-157
2001
234
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00377-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm234.html#Hasunuma01
2005-10-13
Extending graph colorings using no extra colors.
125-132
2001
234
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00376-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm234.html#AlbertsonM01
2005-10-13
A characteristic property of spheres in regular trees.
143-148
2001
234
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00398-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm234.html#Vieli01
2005-10-13
A necessary and sufficient condition for a graph to be edge tenacious.
191-197
2001
234
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00400-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm234.html#WangZ01a
2005-10-13
On covering intersecting set-systems by digraphs.
187-189
2001
234
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00381-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm234.html#Szego01
2005-10-13
Relatively orthomodular lattices.
17-38
2001
234
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00189-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm234.html#Hedlikova01
2005-10-13
On 4-connected graphs without even cycle decompositions.
181-186
2001
234
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00380-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm234.html#Rizzi01a
2005-10-13
On nice graphs.
39-51
2001
234
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00190-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm234.html#HellKRS01
2005-10-13
The number of edges in critical strongly connected graphs.
119-123
2001
234
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00395-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm234.html#AharoniB01
2005-10-13
<i>K</i><sub>5</sub><i>K</i><sub>n</sub><i>n</i>.
159-169
2001
234
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00399-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm234.html#HornakP01
2005-10-13
Edge-disjoint spanners of complete bipartite graphs.
65-76
2001
234
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00192-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm234.html#LaforestLSS01
2005-10-13
On the nonembeddability and crossing numbers of some toroidal graphs on the Klein bottle.
77-88
2001
234
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00193-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm234.html#Riskin01
2005-10-13
Sharply 2-transitive groups of projectivities in generalized polygons.
89-100
2001
234
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00195-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm234.html#Maldeghem01
2005-10-13
i gamma(1)-perfect graphs.
133-138
2001
234
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00396-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm234.html#DohmenRV01
2005-10-13
On suborbital graphs for some Hecke groups.
53-64
2001
234
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00191-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm234.html#Keskin01
2005-10-31
Idempotent endomorphisms of a graph.
379-386
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00105-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#Li00
2005-10-13
<i>T</i>-span of graphs.
171-179
2001
234
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00378-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm234.html#Janczewski01
2005-10-14
Pancyclic in-tournaments.
193-204
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00238-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#Tewes01
2005-10-14
Digraph embedding.
321-328
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00249-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#Hashemi01
2005-10-14
On vertex neighborhood in minimal imperfect graphs.
211-218
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00240-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#Barre01
2005-10-14
New bounds on the diameter vulnerability of iterated line digraphs.
103-113
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00230-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#FerreroP01
2005-10-14
Note on compact packing of a graph.
205-210
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00239-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#Wozniak01
2005-10-14
Strengthening the closure concept in claw-free graphs.
55-63
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00226-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#BroersmaR01
2005-10-14
The crossing numbers of Cartesian products of paths with 5-vertex graphs.
353-359
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00251-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#Klesc01
2005-10-14
Diameter in iterated path graphs.
151-161
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00234-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#KnorN01
2005-10-14
Ordered graceful labellings of the 2-star.
183-191
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00237-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#NowakowskiW01
2005-10-14
On lacets and their manifolds.
299-320
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00248-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#CrapoR01
2005-10-14
Light subgraphs of multigraphs on compact 2-dimensional manifolds.
329-351
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00250-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#JendrolV01
2005-10-14
Sparse sets in the complements of graphs with given girth.
163-174
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00235-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#KostochkaW01a
2005-10-14
Otakar Boruvka on minimum spanning tree problem Translation of both the 1926 papers, comments, history.
3-36
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00224-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#NesetrilMN01
2005-10-14
All trees of diameter five are graceful.
133-150
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00233-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#HrnciarH01
2005-10-14
Colorings and homomorphisms of degenerate and bounded degree graphs.
257-276
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00245-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#KostochkaNS01
2005-10-14
Chromatic numbers of integer distance graphs.
239-246
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00243-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#KemnitzM01
2005-10-14
On quasifactorability in graphs.
85-92
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00228-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#CaiFL01
2005-10-14
Optimal embeddings of generalized ladders into hypercubes.
65-83
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00227-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#CahaK01
2005-10-14
On oriented path double covers.
371-380
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00253-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#MaxovaN01
2005-10-14
Stable dominating circuits in snarks.
247-256
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00244-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#Kochol01
2005-10-14
Foreword.
1-2
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00223-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#FiedlerKN01
2005-10-14
Lower bound on the minus-domination number.
361-370
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00252-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#Matousek01
2005-10-14
Miscellaneous properties of embeddings of line, total and middle graphs.
37-54
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00225-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#BozaDMM01
2005-10-14
Graph partition problems into cycles and paths.
93-101
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00229-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#Enomoto01
2005-10-14
On recognizing Cartesian graph bundles.
381-391
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00254-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#ZmazekZ01
2005-10-14
Construction of sparse graphs with prescribed circular colorings.
277-291
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00246-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#NesetrilZ01
2005-10-14
Channel assignment and multicolouring of the induced subgraphs of the triangular lattice.
219-231
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00241-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#Havet01
2005-10-14
<i>Z</i><sub>m</sub>-well-covered graphs for some classes of graphs.
293-297
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00247-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#BarbosaH01
2005-10-14
A new proof of the independence ratio of triangle-free cubic graphs.
233-237
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00242-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#HeckmanT01
2005-10-14
Some remarks on cycles in graphs and digraphs.
175-182
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00236-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#LoeblM01
2005-10-14
On seed graphs with more than two components.
115-126
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00231-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#Froncek01a
2005-10-14
Graphs with average labellings.
127-132
2001
233
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00232-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm233.html#HarmincS01
2005-10-14
Nonisomorphic complete triangulations of a surface.
11-18
2001
232
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00398-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm232.html#BrachoS01
2005-10-14
<i>Z</i><sub>p</sub>.
91-94
2001
232
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00351-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm232.html#BayatT01
2005-10-14
Further results on de Bruijn weight classes.
171-173
2001
232
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00354-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm232.html#Mayhew01
2005-10-14
The largest demigenus of a bipartite signed graph.
189-193
2001
232
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00349-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm232.html#Zaslavsky01
2005-10-14
On the sum number of wheels.
185-188
2001
232
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00347-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm232.html#SuttonM01
2005-10-14
Bounded vertex coloring of trees.
145-151
2001
232
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00345-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm232.html#JarvisZ01
2005-10-14
A generalization of the Hirschhorn-Farkas-Kra septagonal numbers identity.
113-118
2001
232
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00297-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm232.html#Garvan01
2005-10-14
Acyclic orientations and chromatic generating functions.
119-130
2001
232
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00344-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm232.html#Gessel01
2005-10-14
On the independence number of a graph in terms of order and size.
131-138
2001
232
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00298-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm232.html#HarantS01
2005-10-14
<i>q</i>-cones.
95-103
2001
232
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00343-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm232.html#BoninQ01
2005-10-14
On the nullity of line graphs of trees.
35-45
2001
232
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00187-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm232.html#GutmanS01
2005-10-14
Deciding constructibility of 3-balls with at most two interior vertices.
47-58
2001
232
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00188-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm232.html#Hachimori01
2005-10-14
Implicational classes of De Morgan Boolean algebras.
59-66
2001
232
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00173-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm232.html#Pynko01
2005-10-14
On the number of visibility graphs of simple polygons.
139-143
2001
232
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00353-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm232.html#HurtadoN01
2006-04-19
The ultimate categorical matching in a graph.
1-9
2001
232
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00181-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm232.html#AlbertHN01
2005-10-14
The existence of referee squares.
109-112
2001
232
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00296-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm232.html#DinitzL01
2005-10-14
An algebraic identity of F.H. Jackson and its implications for partitions.
77-83
2001
232
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00295-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm232.html#AndrewsL01
2005-10-14
On a combinatorial problem.
67-76
2001
232
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00194-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm232.html#Smadici01
2005-10-14
A characteristic polynomial for rooted graphs and rooted digraphs.
19-33
2001
232
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00186-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm232.html#GordonM01
2005-10-14
Hamiltonicity and circular distance two labellings.
163-169
2001
232
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00299-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm232.html#Liu01
2005-10-14
Restricted bipartitions.
85-89
2001
232
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00294-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm232.html#AndrewsL01a
2005-10-14
<i>K</i><sub>4</sub><i>e</i>)-free graphs.
105-108
2001
232
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00352-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm232.html#FigueiredoGS01
2005-10-14
Chromatic equivalence classes of certain cycles with edges.
175-183
2001
232
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00355-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm232.html#OmoomiP01
2005-10-14
On a conjecture concerning optimal orientations of the cartesian product of a triangle and an odd cycle.
153-161
2001
232
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00346-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm232.html#KohT01
2005-10-14
<i>K</i><sub>p, q</sub>-factorization of symmetric complete tripartite digraphs.
459-467
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00339-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#UshioO01
2005-10-14
Domination parameters and edge-removal-critical graphs.
221-239
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00319-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#GroblerM01
2005-10-14
On bipartite tournaments balanced with respect to carry-over effects for both teams.
81-87
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00306-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#BedfordOW01
2005-10-14
Nested balanced incomplete block designs.
351-389
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00332-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#MorganPR01
2005-10-14
An involution on derangements.
121-122
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00310-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#Chapman01
2005-10-14
The ratio of the longest cycle and longest path in semicomplete multipartite digraphs.
453-457
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00338-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#TewesV01
2005-10-14
Two-factors with few cycles in claw-free graphs.
191-197
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00317-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#GouldJ01
2005-10-14
Directed strongly regular graphs with mu=lambda.
289-293
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00325-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#Jorgensen01
2006-04-28
Edge disjoint monochromatic triangles in 2-colored graphs.
135-141
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00312-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#ErdosFGJL01
2005-10-14
<i>k</i><i>n</i><sup>h</sup>).
447-451
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00337-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#Sonnino01
2005-10-14
On arcs in projective Hjelmslev planes.
265-278
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00323-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#HonoldL01
2005-10-14
Ramsey properties of generalised irredundant sets in graphs.
123-134
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00311-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#CockayneFGMP01
2005-10-14
Pushing the cycles out of multipartite tournaments.
279-287
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00324-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#HuangMW01
2005-10-14
On domination and annihilation in graphs with claw-free blocks.
143-151
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00313-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#FavaronHPR01
2005-10-14
Partitions of factorisations of parameter words.
169-175
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00315-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#FouchePS01
2005-10-14
Steiner pentagon covering designs.
11-26
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00302-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#AbelBZZ01
2005-10-14
The mu-way intersection problem for m-cycle systems.
27-56
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00303-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#AdamsBBK01
2005-10-14
<i>k</i>-arc transitive digraphs.
337-349
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00331-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#MansillaS01
2005-10-14
Transitive parabolic unitals in translation planes of odd order.
3-10
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00301-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#AbatangeloKL01
2005-10-14
Generalization of matching extensions in graphs.
311-320
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00328-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#LiuY01
2005-10-14
Chromatic polynomials and their zeros and asymptotic limits for families of graphs.
421-446
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00336-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#Shrock01
2005-10-14
On vertex orderings and the stability number in triangle-free graphs.
411-420
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00335-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#Rautenbach01
2005-10-14
Algebraic dependence of commuting differential operators.
247-252
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00321-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#Hellstrom01
2005-10-14
Discrete dynamics over double commutative-step digraphs.
57-72
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00304-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#AguiloD01
2005-10-14
On an adjacency property of almost all graphs.
103-119
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00309-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#BonatoC01
2005-10-14
Bounds on the maximum number of Latin squares in a mutually quasi-orthogonal set.
89-96
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00307-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#BedfordW01
2005-10-14
Enumeration of almost Moore digraphs of diameter two.
177-190
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00316-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#Gimbert01
2005-10-14
Ramsey numbers in octahedron graphs.
241-246
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00320-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#HarborthM01
2005-10-14
<i>v</i><i>k</i>=5.
403-409
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00334-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#Phillips01
2005-10-14
The place of super edge-magic labelings among other classes of labelings.
153-168
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00314-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#Figueroa-CentenoIM01
2005-10-14
The achromatic number of the union of paths.
331-335
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00330-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#MacGillivrayR01
2005-10-14
Roots of chromatic polynomials.
97-102
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00308-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#Bielak01
2005-10-14
On restricted matching extension in planar graphs.
73-79
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00305-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#AldredP01
2005-10-14
On 3-cut reductions of minimally 1-factorable cubic bigraphs.
303-310
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#Labbate01
2005-10-14
Modular gracious labellings of trees.
199-219
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00318-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#GrannellGH01
2005-10-14
Aspects of edge list-colourings.
253-264
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00322-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#HiltonSS01
2005-10-14
Compression of transfer matrices.
321-329
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00329-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#Lundow01
2005-10-14
Preface.
1-2
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00300-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#Woodall01
2005-10-14
A characterization of the Jacobi logarithms of a finite field.
295-302
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00326-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#Keedwell01
2005-10-14
Extended synchronizing codewords for q-ary complete prefix codes.
391-401
2001
231
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00333-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm231.html#PerkinsE01
2005-10-17
Relations between the covering and Newton radii of binary codes.
81-88
2001
238
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00412-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm238.html#Klve01
2005-10-31
Paul Catlin 1948-1995.
3-12
2001
230
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00065-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm230.html#HobbsLR01
2005-10-31
The question of the collapsibility of random 3-regular graphs.
253-
2001
230
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00084-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm230.html#Spencer01
2005-10-31
On graph planarity and semi-duality.
149-166
2001
230
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00078-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm230.html#Kelmans01
2005-10-31
<i>k</i><i>K</i><sub>1, 4</sub>-free graphs.
113-118
2001
230
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00074-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm230.html#CaiS01
2006-02-10
Capelli polynomials, almost-permutation matrices and sparse Eulerian graphs.
49-61
2001
230
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00069-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm230.html#LeeRST01
2005-10-31
Results on degrees and the structure of 2-factors.
99-111
2001
230
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00072-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm230.html#Gould01
2005-10-31
On the spanning tree packing number of a graph: a survey.
13-21
2001
230
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00066-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm230.html#Palmer01
2005-10-31
Eulerian subgraphs containing given edges.
63-69
2001
230
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00070-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm230.html#Lai01
2005-10-31
Nowhere zero flows in line graphs.
133-141
2001
230
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00076-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm230.html#ChenLL01
2005-10-31
<i>V</i><sub>8</sub>-minors.
207-213
2001
230
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00081-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm230.html#RobertsonZ01
2005-10-31
On Homotopy of connected graphs having the same degree function.
167-187
2001
230
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00079-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm230.html#Kelmans01a
2005-10-31
Graph family operations.
71-97
2001
230
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00071-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm230.html#CatlinHL01
2005-10-31
<i>X, Y</i>)-intersection graphs.
119-131
2001
230
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00075-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm230.html#CaiCP01
2005-10-31
A weak immersion relation on graphs and its applications.
189-206
2001
230
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00080-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm230.html#GovindanR01
2005-10-31
Forbidden minors to graphs with small feedback sets.
215-252
2001
230
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00083-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm230.html#DinneenCF01
2005-10-31
Eulerian straight ahead cycles in drawings of complete bipartite graphs.
45-48
2001
230
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00068-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm230.html#Harborth01
2005-10-31
(Some of) the many uses of Eulerian graphs in graph theory (plus some applications).
23-43
2001
230
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00067-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm230.html#Fleischner01
2005-10-31
Dedication.
1-
2001
230
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00356-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm230.html#HobbsL01
2005-10-31
On topological aspects of orientations.
57-72
2001
229
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00201-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm229.html#FraysseixM01
2005-10-31
On the map theorem.
171-184
2001
229
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00207-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm229.html#Kauffman01
2005-10-31
Combinatorial methods in analysis.
235-259
2001
229
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00212-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm229.html#Ptak01
2005-10-31
Asymptotic enumeration, global structure, and constrained evolution.
213-233
2001
229
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00211-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm229.html#PromelST01
2005-11-02
25 Pretty graph colouring problems.
167-169
2001
229
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00206-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm229.html#JensenB01
2005-10-31
I. Schur, C.E. Shannon and Ramsey Numbers, a short story.
185-195
2001
229
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00208-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm229.html#NesetrilR01
2005-10-31
Oriented graph coloring.
359-369
2001
229
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00216-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm229.html#Sopena01
2005-10-31
Circular chromatic number: a survey.
371-410
2001
229
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00217-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm229.html#Zhu01
2005-10-31
Convexity and fixed-point properties in Helly graphs.
197-211
2001
229
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00210-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm229.html#Polat01
2005-10-31
Ramsey-Turán theory.
293-340
2001
229
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00214-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm229.html#SimonovitsS01
2005-10-31
Survey of results on k-ordered graphs.
73-87
2001
229
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00202-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm229.html#Faudree01
2005-10-31
Spanning subset sums for finite Abelian groups.
89-99
2001
229
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00203-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm229.html#Griggs01
2005-11-02
DIMATIA surveys (related to the Fifth Czech and Slovak Symposium on Combinatorics, Graph Theory, Algorithms and Applications held in Prague on July 6-11, 1998).
1-2
2001
229
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00222-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm229.html#FiedlerKN01a
2005-10-31
Randomness in lattice point problems.
29-55
2001
229
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00200-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm229.html#Beck01
2005-10-31
Hedetniemi's conjecture -- a survey.
261-292
2001
229
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00213-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm229.html#Sauer01
2006-05-08
Representing graphs by disks and balls (a survey of recognition-complexity results).
101-124
2001
229
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00204-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm229.html#HlinenyK01
2005-10-31
Triangle group representations and their applications to graphs and maps.
341-358
2001
229
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00215-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm229.html#Siran01
2005-10-31
Faster exact algorithms for hard problems: A parameterized point of view.
3-27
2001
229
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00199-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm229.html#AlberGN01
2005-10-31
On cycle-double covers of graphs of small oddness.
125-165
2001
229
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00205-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm229.html#Huck01
2005-10-31
Diameter of the NEPS of bipartite graphs.
373-376
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00160-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#BrualdiS01
2005-10-31
Combinatorics of geometrically distributed random variables: Value and position of the rth left-to-right maximum.
255-267
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00133-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#KnopfmacherP01
2005-10-31
The number of permutations with a given signature, and the expectations of their elements.
423-430
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00176-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#Szpiro01
2005-10-31
A bound for multicolor Ramsey numbers.
419-421
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00175-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#ShiZ01
2005-10-31
Shortest paths in conservative graphs.
143-153
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00128-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#ConfortiR01
2005-10-31
<i>R</i><sup>d</sup>.
347-349
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00209-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#Morgenstern01
2005-10-31
Optimal binary linear codes of dimension at most seven.
51-70
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00125-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#BouyuklievJ01
2005-10-31
On the planarity of iterated jump graphs.
93-106
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00182-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#ChartrandVZ01
2005-10-31
Tolerance orders and bipartite unit tolerance graphs.
35-50
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00124-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#BogartJLM01
2005-10-31
On reconstructing arrangements from their sets of simplices.
175-190
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00185-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#ForgeA01
2005-10-31
Fiber-complemented graphs -- I: structure and invariant subgraphs.
107-141
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00183-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#Chastand01
2005-10-31
On quasiabelian Cayley graphs.
445-447
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00178-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#Zgrablic01
2005-10-31
A note on ascending subgraph decompositions of complete multipartite graphs.
397-402
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00171-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#FuH01
2005-10-31
Digraphs of degree two which miss the Moore bound by two.
269-280
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00134-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#MillerS01
2005-10-31
On generalized constraints and certificates.
211-232
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00166-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#Hellerstein01
2005-10-31
The 224 non-chordal graphs on less than 10 vertices whose chromatic polynomials have no complex roots.
387-396
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00170-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#DAntonaMZ01
2005-10-31
Two relations for median graphs.
351-353
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00120-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#Skrekovski01
2005-10-31
All odd musquashes are standard.
71-91
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00126-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#CairnsK01
2005-10-31
The decay number and the maximum genus of diameter 2 graphs.
191-197
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00130-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#FuTX01
2005-10-31
Realization of set functions as cut functions of graphs and hypergraphs.
199-210
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00164-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#FujishigeP01
2005-10-31
Monotone paths in edge-ordered sparse graphs.
411-417
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00174-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#RodittySY01
2005-10-31
Using minimum degree to bound average distance.
365-371
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00156-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#BeezerRS01
2005-10-31
Boundary graphs: The limit case of a spectral property.
155-173
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00184-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#FiolGY01
2005-10-31
On characters of Weyl groups.
355-358
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00165-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#AdinPR01
2005-10-31
Resolvable BIBDs with block size 7 and index 6.
1-20
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00123-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#AbelGMZ01
2005-10-31
Extremal graphs with prescribed circumference and cocircumference.
299-308
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00047-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#Wu00
2005-10-31
<i>t</i><i>m</i>-Boxes.
21-33
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00180-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#AgnarssonDS01
2005-10-31
Perfect graphs of strong domination and independent strong domination.
297-311
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00116-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#RautenbachZ01
2005-10-31
De Bruijn sequences with efficient decoding algorithms.
313-336
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00117-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#Tuliani01
2005-10-31
<i>r, q</i><i>q</i>leq 29.
377-385
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00169-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#ChaoK01
2005-10-31
<i>Z</i><sub>4</sub>.
403-409
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00161-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#HellesethRY01a
2005-10-31
Pebbling and Graham's Conjecture.
431-438
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00177-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#Wang01
2005-10-31
On the hardness of computing maximum self-reduction sequences.
243-253
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00132-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#KingstonS01
2005-10-31
On orthogonal representations of graphs.
359-363
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00168-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#AlekseevL01
2005-10-31
Area of Catalan paths.
439-444
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00162-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#Woan01
2005-10-31
A typical vertex of a tree.
337-345
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00135-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#WeiW01
2005-10-31
<i>l</i>containing two common elements.
233-241
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00131-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#Katona01
2005-10-31
Discrete, sequential dynamical systems.
281-295
2001
226
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00115-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm226.html#MortveitR01
2005-10-31
Algebraic shifting increases relative homology.
137-148
2000
225
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00151-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm225.html#Duval00
2005-10-31
Forestal algebras and algebraic forests (on a new class of weakly compact graphs).
149-172
2000
225
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00152-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm225.html#EvdokimovPT00
2005-10-31
Some counting problems related to permutation groups.
77-92
2000
225
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00148-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm225.html#Cameron00
2005-10-31
Linear recurrences with constant coefficients: the multivariate case.
51-75
2000
225
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00147-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm225.html#Bousquet-MelouP00
2005-11-02
Shuffle algebra and polylogarithms.
217-230
2000
225
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00155-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm225.html#MinhPH00
2005-10-31
Eventually rational and m-sparse points of linear ordinary differential operators with polynomial coefficients.
3-13
2000
225
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00144-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm225.html#Abramov00
2005-10-31
On algebraic identification of causal functionals.
173-191
2000
225
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00153-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm225.html#HespelJ00
2005-10-31
On the enumeration and generation of generalized Dyck words.
121-135
2000
225
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00150-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm225.html#Duchon00
2005-10-31
An inequality involving two eigenvalues of a bipartite distance-regular graph.
193-216
2000
225
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00154-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm225.html#MacLean00
2005-10-31
Preface.
1-
2000
225
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00143-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm225.html#BergeronGS00
2005-10-31
Sorted and/or sortable permutations.
25-50
2000
225
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00146-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm225.html#Bousquet-Melou00
2005-10-31
Domino tableaux, Schützenberger involution, and the symmetric group action.
15-24
2000
225
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00145-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm225.html#BerensteinK00
2005-10-31
On completeness of word reversing.
93-119
2000
225
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00149-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm225.html#Dehornoy00
2005-10-31
Arithmetic progressions with constant weight.
225-237
2000
224
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00048-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm224.html#Yuster00
2005-10-31
Colouring weighted bipartite graphs with a co-site constraint.
125-138
2000
224
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00110-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm224.html#Gerke00
2005-10-31
<sub>m+1</sub><sub>m</sub><sub>m</sub><sub>m-1</sub>and applications.
273-279
2000
224
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00138-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm224.html#Fraenkel00
2005-10-31
<i>a, b</i>]-factors.
289-292
2000
224
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00140-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm224.html#Matsuda00
2005-11-02
Chromatically unique bipartite graphs with low 3-independent partition numbers.
107-124
2000
224
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00094-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm224.html#DongKTH00
2005-10-31
Classification of vertex-transitive graphs of order a prime cubed -- I.
99-106
2000
224
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00090-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm224.html#Dobson00
2005-10-31
On book-wheel Ramsey number.
239-249
2000
224
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00049-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm224.html#Zhou00
2005-10-31
Congruence of (2?2) matrices.
293-297
2000
224
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00141-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm224.html#Williams00
2005-11-02
Properties of Fibonacci languages.
215-223
2000
224
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00089-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm224.html#YuZ00
2005-10-31
The proof of a conjecture of Simion for certain partitions.
139-150
2000
224
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00111-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm224.html#Hildebrand00
2005-10-31
<i>n</i>! conjecture.
15-35
2000
224
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00107-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm224.html#Aval00
2005-11-02
<i>Q</i>-distributive lattices from meet semilattices.
1-14
2000
224
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00106-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm224.html#AbadV00
2005-10-31
<sup>2</sup><i>G</i><sub>2</sub><i>q</i><i>v, k</i>, 1) block designs.
251-258
2000
224
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00050-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm224.html#ZhouLL00
2005-10-31
Cycle index series of structures over digraphs.
165-192
2000
224
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00093-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm224.html#Mendez00
2005-10-31
Remarks on Bárány's theorem and affine selections.
259-263
2000
224
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00136-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm224.html#BalajN00
2005-10-31
The weight hierarchies of outer product codes.
193-205
2000
224
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00063-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm224.html#Park00
2005-10-31
On simultaneous colorings of embedded graphs.
207-214
2000
224
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00064-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm224.html#SandersM00
2005-10-31
Enumeration of vexillary involutions which are equal to their mirror/complement.
281-287
2000
224
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00139-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm224.html#GuibertP00
2005-10-31
Enumeration of labelled quasi-initially connected digraphs.
151-163
2000
224
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00112-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm224.html#JovovicK00
2005-10-31
Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes.
79-98
2000
224
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00109-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm224.html#Deppe00
2005-10-31
<i>k</i>)-perfect graphs.
265-271
2000
224
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00137-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm224.html#DohmenRV00
2005-10-31
Size functions of subgeometry-closed classes of representable combinatorial geometries.
37-60
2000
224
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00108-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm224.html#BoninQ00
2005-10-31
On constructible graphs, infinite bridged graphs and weakly cop-win graphs.
61-78
2000
224
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00127-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm224.html#ChastandLP00
2005-10-31
A proof of the Beyer-Stein-Ulam relation between complexity and entropy.
367-372
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00100-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#Galatolo00
2005-10-31
On the powers of graphs with bounded asteroidal number.
125-133
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00043-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#HoCW00
2005-10-31
Frequency-distance constraints with large distances.
227-251
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00016-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#McDiarmid00
2005-10-31
Three distance theorem and grid graph.
355-362
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00098-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#Chevallier00
2005-10-31
<i>K</i><sub>2, 2</sub><i>K</i><sub>1, n</sub><i>K</i><sub>2, n</sub><i>K</i><sub>2, n</sub>bipartite Ramsey numbers.
83-92
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00041-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#CarnielliC00
2005-10-31
<i>Q</i>-polynomial distance-regular graphs.
189-206
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00045-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#Lewis00
2005-10-31
Heavy paths and cycles in weighted graphs.
327-336
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00413-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#ZhangLB00
2005-10-31
The number of spanning trees in circulant graphs.
337-350
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00414-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#ZhangYG00
2005-10-31
<i>n</i>.
109-123
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00062-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#EvansIN00
2005-10-31
Arrangements of hemispheres and halfspaces.
217-226
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(98)00360-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#LinhartYP00
2005-10-31
<sub>k</sub>-factorization of symmetric complete bipartite and tripartite multi-digraphs.
393-397
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00104-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#UshioO00
2005-10-31
Tilings and rotations on the torus: a two-dimensional generalization of Sturmian sequences.
27-53
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00039-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#BertheV00
2005-10-31
Optimal binary linear codes of length leq 30.
135-155
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00135-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#Jaffe00
2005-10-31
On the chromatic number of tree graphs.
363-366
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00092-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#Estivill-CastroNU00
2005-10-31
<i>S</i><sup>2</sup><i>S</i><sup>2</sup>.
175-187
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00044-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#LassmannS00
2005-10-31
Recognizing random intersection graphs.
263-274
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00018-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#Prisner00
2005-10-31
On Alspach's conjecture with two even cycle lengths.
1-12
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00051-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#AdamsBK00
2005-10-31
Some results on an edge coloring problem of Folkman and Fulkerson.
13-25
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00061-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#Asratian00
2005-10-31
Bisingular maps on the sphere and the projective plane.
275-285
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00015-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#RenL00
2005-10-31
On sums and intersects of sequences.
351-354
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00097-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#Chen00
2005-10-31
<i>L</i><sub>1</sub>-graphs.
207-216
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00046-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#LiS00
2005-10-31
<sub>6</sub>.
373-378
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00101-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#Harada00
2005-10-31
Indecomposability and duality of tournaments.
55-82
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00040-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#BoudabbousDI00
2005-10-31
An extremal connectivity parameter of tournaments.
157-173
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00014-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#KlostermeyerS00
2005-10-31
On the number of large h-hypergraphs with a fixed diameter.
287-297
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00019-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#Tomescu00
2005-10-31
Self-complementary graphs and Ramsey numbers Part I: the decomposition and construction of self-complementary graphs.
309-326
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00020-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#XuW00
2005-10-31
Classification of binary/ternary one-error-correcting codes.
253-262
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00017-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#Ostergard00
2005-10-31
Induced cycle structure and outerplanarity.
387-392
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00103-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#McKee00
2005-10-31
On small uniquely vertex-colourable graphs and Xu's conjecture.
93-108
2000
223
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00042-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm223.html#DaneshgarN00
2005-10-31
A classification of 2-arc-transitive circulant digraphs.
281-284
2000
222
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00056-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm222.html#MengW00
2005-10-31
The Carlitz lattice path polynomials.
291-298
2000
222
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00058-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm222.html#Wagner00
2005-10-31
Fraenkel's conjecture for six sequences.
223-234
2000
222
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00411-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm222.html#Tijdeman00
2005-10-31
Unoriented graphs of monounary algebras.
167-179
2000
222
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00410-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm222.html#Jakubikova-Studenovska00
2005-10-31
Feasible edge colorings of trees with cardinality constraints.
61-72
2000
222
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00006-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm222.html#WerraHKM00
2005-10-31
Existence of DBIBDs with block size not divided by four.
27-40
2000
222
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00003-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm222.html#ChangF00
2005-10-31
Diagonal flips in outer-Klein-bottle triangulations.
41-50
2000
222
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00004-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm222.html#CortesN00
2005-10-31
On Davenport's constant of finite abelian groups with rank three.
111-124
2000
222
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00010-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm222.html#Gao00
2005-10-31
Palindrome complexity bounds for primitive substitution sequences.
259-267
2000
222
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00054-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm222.html#DamanikZ00
2005-10-31
Degree-preserving spanning trees in small-degree graphs.
51-60
2000
222
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00005-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm222.html#Damaschke00
2005-10-31
An upper bound on the cover time for powers of graphs.
181-190
2000
222
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00013-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm222.html#Jonasson00
2005-10-31
New lower bounds for covering codes.
125-149
2000
222
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00011-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm222.html#HabsiegerP00
2005-10-31
A generalized Ramsey problem.
247-249
2000
222
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00052-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm222.html#Axenovich00
2005-10-31
Enumeration of planar two-face maps.
1-25
2000
222
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00406-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm222.html#BousquetLL00
2005-10-31
On 1-factors and matching extension.
285-290
2000
222
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00057-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm222.html#Nishimura00
2005-10-31
An attempt to classify bipartite graphs by chromatic polynomials.
73-88
2000
222
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00007-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm222.html#DongKTLH00
2005-10-31
Free Stone algebras.
251-257
2000
222
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00053-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm222.html#CignoliT00
2005-10-31
Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs.
269-274
2000
222
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00055-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm222.html#GutinTY00
2005-10-31
Conic reduction of graphs for the stable set problem.
199-211
2000
222
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00408-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm222.html#Lozin00
2005-10-31
Derivatives are essentially integer partitions.
235-245
2000
222
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00412-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm222.html#Yang00
2005-10-31
A lower bound on the number of hamiltonian cycles.
275-280
2000
222
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00060-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm222.html#HorakS00
2005-10-31
<i>H</i>-colouring of bounded degree graphs.
101-109
2000
222
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00009-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm222.html#GalluccioHN00
2005-10-31
Acyclic domination.
151-165
2000
222
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00012-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm222.html#HedetniemiHR00
2005-10-31
A family of partitions with attached parts and 'N copies of N'.
213-222
2000
222
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00409-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm222.html#SantosM00
2005-10-31
<i>m</i>-ary tree.
89-100
2000
222
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00008-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm222.html#FuS00
2005-10-31
Bondage number of planar graphs.
191-198
2000
222
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00405-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm222.html#KangY00
2005-10-31
<i>n</i>-gons.
125-154
2000
221
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00391-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm221.html#Shephard00
2005-10-31
Parallelogram-faced isohedra with edges in mirror-planes.
93-100
2000
221
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00388-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm221.html#Grunbaum00
2005-10-31
Diffraction from visible lattice points and kth power free integers.
3-42
2000
221
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00384-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm221.html#BaakeMP00
2005-10-31
Tiling the pentagon.
113-124
2000
221
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00390-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm221.html#DingSZ00
2005-10-31
<sup>ast(2F)</sup>derived by the projection method.
101-112
2000
221
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00389-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm221.html#PapadopolosHK00
2005-10-31
The partition conjecture.
61-78
2000
221
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00386-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm221.html#Eckhoff00
2005-10-31
Oracle-polynomial-time approximation of largest simplices in convex bodies.
79-92
2000
221
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00387-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm221.html#BriedenGK00
2005-10-31
The Extension Theorem.
43-59
2000
221
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00385-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm221.html#Dolbilin00
2005-10-31
On the bounded domination number of tournaments.
257-261
2000
220
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00029-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm220.html#LuWW00
2005-10-31
Cycle decompositions of crowns.
251-255
2000
220
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00028-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm220.html#LinL00
2005-10-31
On poset similarity.
75-88
2000
220
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00401-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm220.html#Fishkind00
2006-05-05
Every tree is 3-equitable.
283-289
2000
220
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00033-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm220.html#SpeyerS00
2005-10-31
Coloring arcs of convex sets.
107-117
2000
220
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00403-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm220.html#HarborthL00
2005-10-31
Transchordal graphs.
171-182
2000
220
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00378-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm220.html#McKee00a
2005-10-31
A self-dual poset on objects counted by the Catalan numbers and a type-B analogue.
35-49
2000
220
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00397-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm220.html#BonaS00
2005-10-31
A five-color theorem.
279-281
2000
220
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00032-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm220.html#SandersZ00
2005-10-31
Colouring triangle-free intersection graphs of boxes on the plane.
243-249
2000
220
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00027-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm220.html#KostochkaP00
2005-10-31
Sequences with idempotent products from finite regular semigroups.
159-170
2000
220
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00407-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm220.html#Loyola00
2005-10-31
On the planarity of jump graphs.
119-129
2000
220
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00404-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm220.html#HeviaVZ00
2005-10-31
<i>K</i><sub>2n</sub>minus a 1-factor.
1-11
2000
220
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00377-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm220.html#AdamsBDL00
2005-10-31
Series and parallel reductions for the Tutte polynomial.
291-297
2000
220
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00035-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm220.html#Traldi00
2005-10-31
Graph eigenspaces of small codimension.
271-278
2000
220
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00031-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm220.html#RowlinsonB00
2005-10-31
About the upper chromatic number of a co-hypergraph.
67-73
2000
220
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00382-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm220.html#DiaoZZ00
2005-10-31
Restricted words by adjacencies.
183-200
2000
220
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00380-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm220.html#Rawlings00
2005-10-31
The cycle space of a 3-connected hamiltonian graph.
13-33
2000
220
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00396-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm220.html#BarovichL00
2005-10-31
Decomposition of graphical sequences and unigraphs.
201-238
2000
220
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00381-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm220.html#Tyshkevich00
2005-10-31
The reconstruction of a matroid from its connectivity function.
131-143
2000
220
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00376-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm220.html#LemosM00
2005-10-31
Eccentricity-approximating trees in chordal graphs.
263-269
2000
220
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00030-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm220.html#Prisner00a
2005-10-31
On size, circumference and circuit removal in 3-connected matroids.
145-157
2000
220
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00379-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm220.html#LemosO00
2005-10-31
A hypergroupal characterization of projective planes.
89-105
2000
220
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00402-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm220.html#Gentile00
2005-10-31
<i>L</i><i>d</i>, 1)-labelings of graphs.
57-66
2000
220
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00400-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm220.html#ChangKKLY00
2005-10-31
<i>f</i>-factors.
239-242
2000
220
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00034-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm220.html#EnomotoT00
2005-10-31
Asymptotic bounds for some bipartite graph: complete graph Ramsey numbers.
51-56
2000
220
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00399-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm220.html#CaroLRZ00
2005-10-31
<i>M</i><sub>3</sub><i>F</i><sub>q</sub><i>q</i>odd).
37-47
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00366-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#CorbasW00
2005-10-31
<i>G</i>vertex-multiplications.
153-171
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00373-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#KohT00
2005-10-31
Bipartite Ramsey numbers and Zarankiewicz numbers.
85-95
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00370-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#GoddardHO00
2005-10-31
Extending partial colorings of graphs.
145-152
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00372-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#Kierstead00
2005-10-31
On the discrepancy of strongly unimodular matrices.
223-233
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00345-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#PengY00
2005-10-31
Feedback functions for generating cycles over a finite alphabet.
187-194
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00375-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#Landsberg00
2005-10-31
Modified group divisible designs with block size four.
207-221
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00342-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#LingC00
2005-10-31
Cyclic inequivalence of cascaded GMW-sequences.
279-285
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00026-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#GolombGD00
2005-10-31
Clique covering the edges of a locally cobipartite graph.
17-26
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00333-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#ChenJKLSW00
2005-10-31
On median graphs and median grid graphs.
287-293
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00085-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#KlavzarS00
2005-10-31
Cyclically resolvable cyclic Steiner triple systems of order 21 and 39.
173-185
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00374-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#LamM00
2005-10-31
Achromatic number versus pseudoachromatic number: a counterexample to a conjecture of Hedetniemi.
271-274
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00025-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#Edwards00
2005-10-31
On the blocking sets in S(3, 6, 22) and S(4, 7, 23).
249-252
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00021-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#Bao00
2005-10-31
Coloring triangle-free graphs with fixed size.
275-277
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00087-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#GimbelT00
2005-10-31
Short proof of Menger's Theorem.
295-296
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00088-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#Goring00
2005-10-31
Congruences for a restricted m-ary partition function.
265-269
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00024-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#DolphRS00
2005-11-02
Upper minus domination in regular graphs.
135-144
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00245-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#KangC00
2005-10-31
Explicit semisymmetric chain decomposition of the partition lattice.
259-264
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00023-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#DeodharS00
2005-10-31
Lower and upper bounds on the total weight of semi-rich acyclic arrangements of oriented lines in the plane.
107-122
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00371-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#Heinz00
2005-10-31
A Fan-type condition for claw-free graphs to be Hamiltonian.
195-205
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00341-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#Li00a
2005-10-31
Minimal reducible bounds for 1-nonouterplanar graphs.
9-15
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00364-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#BorowieckiHS00
2005-10-31
Gray codes for necklaces.
235-248
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00348-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#Ueda00
2005-10-31
Polychromatic polynomials.
1-7
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00363-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#BollobasR00
2005-10-31
Shadow lattices and shadow codes.
49-64
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00368-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#DoughertyHS00
2005-10-31
On generalized Tribonacci sequences and additive partitions.
65-83
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00369-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#Dumitriu00
2005-10-31
<i>q</i>-ary codes of covering radius one.
97-106
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00338-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#Haas00
2005-10-31
On the bipartite case of El-Zahárs conjecture.
123-134
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00086-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#Johansson00
2005-10-31
<sup>+</sup><i>n</i>, 2).
27-35
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00365-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#Cooperstein00
2005-10-31
Solution to a problem on degree sequences of graphs.
253-257
2000
219
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(00)00022-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm219.html#CaiDZ00
2005-10-31
Pseudototal colourings of digraphs.
253-263
2000
218
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00349-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm218.html#Zwonek00
2005-10-31
Isomorphic factorization of de Bruijn digraphs.
199-208
2000
218
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00304-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm218.html#ShibataHF00
2005-10-31
On the maximal length of a snake in hypercubes of small dimension.
51-59
2000
218
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00335-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm218.html#EmelyanovL00
2005-10-31
<i>q</i>-cones of matroids.
271-275
2000
218
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00358-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm218.html#OxleyW00
2005-10-31
On the number of chord diagrams.
209-233
2000
218
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00347-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm218.html#Stoimenow00
2005-10-31
Characterization of quadric cones in a Galois projective space.
25-31
2000
218
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00303-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm218.html#MonteFF00
2005-10-31
A refinement of Vizing's theorem.
289-291
2000
218
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00361-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm218.html#Steffen00
2005-10-31
Irregularity strength and compound graphs.
235-243
2000
218
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00305-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm218.html#Togni00
2005-10-31
Even pairs in Artemis graphs.
185-197
2000
218
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00346-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm218.html#Rusu00
2005-10-31
Permutations with forbidden subsequences and a generalized Schro"der number.
121-130
2000
218
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00302-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm218.html#Kremer00
2005-10-31
<i>k</i>even and lambda=1.
9-23
2000
218
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00332-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm218.html#Chang00
2005-10-31
Vertices of degree k in a minimally k-edge-connected digraph.
293-298
2000
218
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00362-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm218.html#YuanC00
2005-10-31
Multi-intersection graphs.
245-251
2000
218
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00306-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm218.html#Zverovich00
2005-10-31
On the 3-connected matroids that are minimal having a fixed spanning restriction.
131-165
2000
218
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00344-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm218.html#LemosO00a
2005-10-31
Generating trees and proper Riordan Arrays.
167-183
2000
218
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00343-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm218.html#MerliniV00
2005-10-31
Graceful numbering of an edge-gluing of shell graphs.
283-287
2000
218
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00360-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm218.html#SethuramanD00
2005-10-31
On the problem of a matching orthogonal to a 2-factorization.
277-282
2000
218
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00359-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm218.html#Sajna00
2005-10-31
Almost Moore digraphs are diregular.
265-270
2000
218
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00357-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm218.html#MillerGSS00
2005-10-31
Polytopes of finite type.
97-108
2000
218
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00339-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm218.html#Hartley00
2005-10-31
On the tight span of an antipodal graph.
73-96
2000
218
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00337-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm218.html#GoodmanM00
2005-10-31
Duadic sequences of prime lengths.
33-49
2000
218
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00367-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm218.html#DingHL00
2005-10-31
Long cycles in 3-cyclable graphs.
1-8
2000
218
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00331-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm218.html#BauerMTV00
2005-10-31
<i>F</i>and kernels in digraphs.
61-71
2000
218
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00336-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm218.html#Galeana-Sanchez00
2005-10-31
Free polygon enumeration and the area of an integral polygon.
109-119
2000
218
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00340-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm218.html#Klain00
2005-10-31
<i>q</i>-ultraspherical functions.
293-299
2000
217
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00268-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm217.html#Morse00
2005-10-31
A bijection between intervals in the Fibonacci posets.
225-235
2000
217
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00264-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm217.html#Kremer00a
2005-10-31
Noncrossing partitions.
367-409
2000
217
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00273-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm217.html#Simion00
2005-10-31
An extension of Zeilberger's fast algorithm to general holonomic functions.
115-134
2000
217
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00259-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm217.html#Chyzak00
2005-10-31
Counting enriched multigraphs according to the number of their edges (or arcs).
237-248
2000
217
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00265-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm217.html#Labelle00
2005-10-31
From Motzkin to Catalan permutations.
33-49
2000
217
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00254-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm217.html#BarcucciLPP00
2005-10-31
Stable matching in a common generalization of the marriage and assignment models.
135-156
2000
217
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00260-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm217.html#ErikssonK00
2005-10-31
On growth of Lie algebras, generalized partitions, and analytic functions.
337-351
2000
217
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00271-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm217.html#Petrogradsky00
2005-10-31
Intersection of modules related to Macdonald's polynomials.
51-64
2000
217
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00255-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm217.html#BergeronH00
2005-10-31
Applications of integer relation algorithms.
65-82
2000
217
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00256-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm217.html#BorweinL00
2005-10-31
Formal rational fractions and random walks on cycles.
301-313
2000
217
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00269-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm217.html#MosbahS00
2005-10-31
Lyndon words, polylogarithms and the Riemann Zeta function.
273-292
2000
217
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00267-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm217.html#MinhP00
2005-10-31
Quantum double Schubert polynomials, quantum Schubert polynomials and Vafa-Intriligator formula.
191-223
2000
217
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00263-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm217.html#KirillovM00
2005-10-31
<i>n</i>! conjecture and a vector bundle on the Hilbert scheme of n points in the plane.
83-99
2000
217
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00257-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm217.html#Chang00a
2005-10-31
Indicators of solvability for lattice models.
167-189
2000
217
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00262-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm217.html#Guttmann00
2005-10-31
Row-convex tableaux and the combinatorics of initial terms.
411-427
2000
217
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00274-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm217.html#Taylor00
2005-10-31
Schubert polynomials, Kazhdan-Lusztig basis and characters.
353-365
2000
217
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00272-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm217.html#Roichman00
2005-10-31
Une bijection géométrique entre une famille d'hypercartes et une famille de polygones énumérées par la série de Schröder.
17-32
2000
217
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00253-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm217.html#ArquesG00
2005-10-31
Belyi functions for Archimedean solids.
249-271
2000
217
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00266-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm217.html#MagotZ00
2005-10-31
On the hypoplactic monoid.
315-336
2000
217
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00270-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm217.html#Novelli00
2005-10-31
Doubly alternating Baxter permutations are Catalan.
157-166
2000
217
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00261-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm217.html#GuibertL00
2005-10-31
On discrete Morse functions and combinatorial decompositions.
101-113
2000
217
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00258-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm217.html#Chari00
2005-10-31
<i>m</i>-Sparse solutions of linear ordinary differential equations with polynomial coefficients.
3-15
2000
217
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00252-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm217.html#Abramov00a
2005-10-31
The computational complexity of cordial and equitable labelling.
29-34
2000
216
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00295-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm216.html#CairnieE00
2005-12-01
On the simultaneous edge-coloring conjecture.
267-272
2000
216
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00353-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm216.html#HajiaghaeeMMST00
2005-10-31
Extremal graphs for inequalities involving domination parameters.
1-10
2000
216
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00251-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm216.html#XuCHHS00
2005-10-31
Embedding trees into graphs of large girth.
273-278
2000
216
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00354-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm216.html#HaxellL00
2005-10-31
A class of ?-perfect graphs.
169-193
2000
216
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00240-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm216.html#FigueiredoV00
2005-10-31
On the existence of graphs with prescribed coloring parameters.
293-297
2000
216
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00351-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm216.html#YegnanarayananBS00
2005-10-31
<i>k</i>-factors. IV.
111-120
2000
216
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00298-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm216.html#EnomotoH00
2005-10-31
The selectope for games with partial cooperation.
11-27
2000
216
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00294-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm216.html#BilbaoJLP00
2005-10-31
The Terwilliger algebra of an almost-bipartite distance-regular graph and its antipodal 2-cover.
35-69
2000
216
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00296-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm216.html#Collins00
2005-10-31
<i>r</i>-regular bipartite graphs.
121-137
2000
216
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00241-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm216.html#FunkL00
2005-10-31
Extremal properties of ray-nonsingular matrices.
221-233
2000
216
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00247-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm216.html#LeeMST00
2005-10-31
On a conjecture of Keedwell and the cycle double cover conjecture.
287-292
2000
216
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00356-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm216.html#MahdianMSST00
2005-10-31
On posets from conjugacy classes of Coxeter groups.
139-152
2000
216
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00242-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm216.html#Gill00
2005-10-31
Computing the rank partition and the flag transversal of a matroid.
85-110
2000
216
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00297-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm216.html#SilvaF00
2005-10-31
A converse of Minkowski's inequality.
253-256
2000
216
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00350-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm216.html#AlzerR00
2005-10-31
Vertex-neighbor-integrity of magnifiers, expanders, and hypercubes.
257-266
2000
216
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00352-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm216.html#Gambrell00
2005-10-31
Diagonal flips in outer-torus triangulations.
71-83
2000
216
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00239-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm216.html#CortesN00a
2005-10-31
Graphs with least domination number three-fifths their order.
153-168
2000
216
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00299-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm216.html#Henning00
2005-10-31
<i>K</i><sub>1, 4</sub>-free graphs.
279-285
2000
216
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00355-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm216.html#Li00b
2006-01-31
<i>P</i><sub>4</sub>-transversals of perfect graphs.
195-210
2000
216
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00300-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm216.html#HoangL00
2005-10-31
On a strange observation in the theory of the dimer problem.
211-219
2000
216
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00301-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm216.html#JohnS00
2005-10-31
Genus distribution of Ringel ladders.
235-252
2000
216
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00250-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm216.html#Tesar00
2005-10-31
Rooted maps on orientable surfaces, Riccati's equation and continued fractions.
1-12
2000
215
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00197-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm215.html#ArquesB00
2005-10-31
Extremal self-dual codes with the smallest covering radius.
271-281
2000
215
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00318-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm215.html#HaradaO00
2005-10-31
Minimal coloring and strength of graphs.
265-270
2000
215
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00319-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm215.html#HajiabolhassanMT00
2005-10-31
A lower bound on the probability of a finite union of events.
147-158
2000
215
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00246-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm215.html#KuaiAT00
2005-10-31
Binary De Bruijn cycles under different equivalence relations.
93-102
2000
215
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00230-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm215.html#Hartke00
2005-10-31
Cameron's construction of two-graphs.
283-291
2000
215
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00320-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm215.html#Ishihara00
2005-10-31
Perfection thickness of graphs.
263-264
2000
215
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00322-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm215.html#AsariJKW00
2005-10-31
<i>k</i>-trees.
245-262
2000
215
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00237-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm215.html#Zhu00
2005-10-31
A study of minimum gossip graphs.
33-57
2000
215
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00227-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm215.html#Fertin00
2005-10-31
The majority action on infinite graphs: strings and puppets.
59-71
2000
215
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00228-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm215.html#GinosarH00
2005-10-31
Signed shape tilings of squares.
133-145
2000
215
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00232-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm215.html#Keating00
2005-10-31
Liftings of automorphisms of hypermaps.
213-224
2000
215
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00249-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm215.html#Surowski00
2005-10-31
Tolerance intersection graphs on binary trees with constant tolerance 3.
115-131
2000
215
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00231-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm215.html#JamisonM00
2005-10-31
The size of switching classes with skew gains.
81-92
2000
215
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00243-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm215.html#HageH00
2005-10-31
<i>R</i>-annihilated and independent perfect neighborhood sets in chordal graphs.
181-199
2000
215
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00235-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm215.html#Puech00
2005-10-31
<sup>n</sup>Cayley graphs.
73-79
2000
215
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00229-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm215.html#GiudiciO00
2005-10-31
Bounds on the strong domination number.
201-212
2000
215
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00248-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm215.html#Rautenbach00
2005-10-31
The asymptotic numbers of certain kinds of regular toroidal maps.
225-244
2000
215
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00236-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm215.html#Szucs00
2005-10-31
Bounded bitolerance digraphs.
13-20
2000
215
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00220-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm215.html#BogartT00
2005-10-31
Closure and factor-critical graphs.
171-179
2000
215
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00234-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm215.html#PlummerS00
2005-11-02
<sub>6</sub>graphs are clique divergent.
159-170
2000
215
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00233-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm215.html#LarrionN00
2005-10-31
Star-factorization of symmetric complete bipartite multi-digraphs.
293-297
2000
215
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00321-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm215.html#Ushio00
2005-10-31
On path-sequential labellings of cycles.
21-32
2000
215
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00226-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm215.html#Fertig00
2005-10-31
On a generalized convolution of incidence functions.
103-113
2000
215
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00244-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm215.html#Haukkanen00
2005-11-09
<i><sup>k</sup></i><i>k</i>geq 2.
251-253
2000
214
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00308-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm214.html#HedenS00
2005-11-09
Schur congruences, Carlitz sequences of polynomials and automaticity.
21-49
2000
214
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00195-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm214.html#AlloucheS00
2005-11-09
Generalized deviation of posets and modular lattices.
1-19
2000
214
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00194-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm214.html#AlbuT00
2005-11-09
Higher edge-connectivities and tree decompositions in regular graphs.
245-250
2000
214
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00314-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm214.html#GutierrezLL00
2005-11-09
Partial list colorings.
235-240
2000
214
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00315-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm214.html#AlbertsonGH00
2005-11-09
An included-minor result for 3-connected graphs with contractible edges.
291-297
2000
214
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00311-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm214.html#Turner00
2005-11-09
On the upper chromatic numbers of the reals.
65-75
2000
214
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00219-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm214.html#Archer00
2005-11-09
Variable degeneracy: extensions of Brooks' and Gallai's theorems.
101-112
2000
214
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00221-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm214.html#BorodinKT00
2005-11-09
Complementary cycles containing prescribed vertices in tournaments.
77-87
2000
214
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00198-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm214.html#Bang-JensenGY00
2005-11-09
<i>r</i>-stars.
275-278
2000
214
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00309-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm214.html#Pikhurko00
2005-11-09
Exponents of 2-regular digraphs.
211-219
2000
214
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00144-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm214.html#Shen00
2005-11-09
Counting circulant graphs of prime-power order by decomposing into orbit enumeration problems.
173-191
2000
214
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00139-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm214.html#LiskovetsP00
2005-11-09
On the number of edges in graphs with a given connected domination number.
193-210
2000
214
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00143-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm214.html#Sanchis00
2005-11-09
Sum numbers of hypertrees.
285-290
2000
214
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00307-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm214.html#SonntagT00
2005-11-09
The Komlós-Sós conjecture for graphs of girth 7.
279-283
2000
214
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00316-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm214.html#Soffer00
2005-11-09
Tiling with notched cubes.
255-261
2000
214
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00310-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm214.html#HochbergR00
2005-11-09
Cayley type graphs and cubic graphs of large girth.
113-121
2000
214
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00222-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm214.html#BrayPR00
2005-11-09
Bipartite covering graphs.
51-63
2000
214
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00196-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm214.html#ArchdeaconKLS00
2005-11-09
On the number of ordered factorizations of natural numbers.
123-133
2000
214
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00223-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm214.html#ChorLM00
2005-11-09
Primitivity, freeness, norm and trace.
135-144
2000
214
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00224-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm214.html#CohenH00
2005-11-09
List improper colorings of planar graphs with prescribed girth.
221-233
2000
214
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00145-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm214.html#Skrekovski00
2005-11-09
Dualizability and graph algebras.
145-172
2000
214
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00225-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm214.html#DaveyILM00
2005-11-09
On the alpha-labeling number of bipartite graphs.
241-243
2000
214
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00313-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm214.html#El-ZanatiFS00
2005-11-09
Hamiltonian decomposition of recursive circulant graphs.
89-99
2000
214
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00199-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm214.html#Biss00
2005-11-09
Continuous colorings associated with certain characteristics of the continuum.
263-273
2000
214
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00312-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm214.html#Moore00
2005-11-09
On the Hajo's number of graphs.
153-161
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00175-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#GutinKT00
2005-11-09
On computing boundary functional sums.
253-260
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00185-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#Sapozhenko00
2005-11-09
Interval orders and dimension.
179-188
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00178-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#KiersteadT00
2005-11-09
On special numberings of hypergraphs.
261-268
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00186-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#Schaar00
2005-11-09
A note on the colour class of a self-complementary graph.
333-336
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00191-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#Wojda00
2005-11-09
Extremal bi-Helly families.
321-331
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00192-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#Tuza00
2005-11-09
Edge isoperimetric inequalities for product graphs.
291-320
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00189-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#Tillich00
2005-11-09
Perfect binary codes: bounds and properties.
283-290
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00188-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#Soloveva00
2005-11-09
Non-hamiltonian polyhedral graphs with two types of faces.
105-113
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00171-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#FabriciOW00
2005-11-09
Hom-properties are uniquely factorizable into irreducible factors.
189-194
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00179-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#KratochvilM00
2005-11-09
<i>n</i>-cube layout on a rectangular grid.
13-19
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00162-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#BezrukovCHRS00
2005-11-09
Sufficient condition for Hamiltonicity of N2-locally connected claw-free graphs.
21-24
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00163-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#Bielak00
2005-11-09
Asymptotical properties of linear codes.
25-28
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00164-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#Blinovsky00
2005-11-09
The McFunction.
163-167
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00176-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#Guu00
2005-11-09
A property of colored complexes and their duals.
245-251
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00184-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#Leck00
2005-11-09
On the packing radius and the covering radius of equal-weight codes.
35-42
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00166-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#CohenK00
2005-11-09
Near-MDS codes over some small fields.
55-65
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00168-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#DodunekovL00
2005-11-09
<i>D</i><sub>3</sub>-paths with a prescribed endvertex.
87-104
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00170-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#EnomotoMO00
2005-11-09
Extendability and factor-criticality.
115-122
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00172-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#Favaron00
2005-11-09
Codes with forbidden distances.
3-11
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00161-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#BassalygoCZ00
2005-11-09
Linear codes over finite fields and finite projective geometries.
211-244
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00183-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#Landjev00
2005-11-09
Performance guarantees and applications for Xia's algorithm.
67-86
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00326-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#DonaliesS00
2006-02-01
Optimal linear arrangement of a rectangular grid.
123-139
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00173-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#FishburnTW00
2005-11-09
Gallai's conjecture for disconnected graphs.
43-54
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00167-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#DeanK00
2005-11-09
A note on generalized chromatic number and generalized girth.
29-34
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00165-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#BollobasW00
2005-11-09
Packing two copies of a tree into its fourth power.
169-178
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00177-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#KheddouciSW00
2005-11-09
The [23, 14, 5] Wagner code is unique.
269-282
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00187-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#Simonis00
2005-11-09
Solitary subgraphs of random graphs.
195-209
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00182-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#KurkowiakR00
2005-11-09
<i>k</i>-matching in a Hamiltonian cycle.
141-151
2000
213
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00174-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm213.html#GancarzewiczW00
2005-11-09
Large sets of oriented triple systems with resolvability.
199-221
2000
212
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(99)00288-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm212.html#KangT00
2005-11-09
On traceable powers of digraphs.
121-128
2000
212
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(99)00213-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm212.html#MarczykS00
2005-11-09
A short solution of Heawood's empire problem on the torus and implications for higher genus.
161-165
2000
212
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(99)00217-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm212.html#Wessel00
2005-11-09
<i><sub>k</sub></i><i><sub>k</sub></i>-stable graphs.
149-160
2000
212
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(99)00216-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm212.html#ToppV00
2005-11-09
On some third parts of nearly complete digraphs.
129-139
2000
212
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(99)00214-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm212.html#MeszkaS00
2005-11-09
Counting faces of cubical spheres modulo two.
169-183
2000
212
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(99)00285-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm212.html#BabsonC00
2005-11-09
On vertex types and cyclic colourings of 3-connected plane graphs.
101-109
2000
212
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(99)00212-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm212.html#HornakJ00
2005-11-09
Hexagonal polyomino achievement.
5-18
2000
212
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(99)00204-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm212.html#BodeH00
2005-11-09
<i><sub>2n</sub></i>with a prescribed condition - I.
233-244
2000
212
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(99)00290-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm212.html#LiuY00
2005-11-09
<i><sub>k</sub></i>-graphic sequences.
223-231
2000
212
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(99)00289-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm212.html#LiS00a
2005-11-09
On self-clique graphs with given clique sizes.
185-189
2000
212
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(99)00286-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm212.html#Chia00
2005-11-09
Minimal reducible bounds for planar graphs.
19-27
2000
212
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(99)00205-8
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm212.html#BorowieckiBM00
2005-11-09
Variable neighborhood search for extremal graphs: 1 The AutoGraphiX system.
29-44
2000
212
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(99)00206-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm212.html#CaporossiH00
2006-10-05
Eigenvalues of Hückel systems of equivalent points.
75-90
2000
212
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(99)00210-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm212.html#FowlerCC00
2005-11-09
Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian.
91-100
2000
212
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(99)00211-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm212.html#GuoTVY00
2005-11-09
Counting lattice paths in restricted planes.
191-198
2000
212
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(99)00287-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm212.html#Choi00
2005-11-09
A note on the compression theorem for convex surfaces.
257-260
2000
212
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(99)00292-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm212.html#WengR00
2005-11-10
On vertex-degree restricted paths in polyhedral graphs.
61-73
2000
212
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(99)00209-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm212.html#FabriciHJW00
2005-11-09
A local property of polyhedral maps on compact two-dimensional manifolds.
111-120
2000
212
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(99)00329-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm212.html#JendrolV00
2005-11-09
On degrees of vertices in paradoxical trees.
53-59
2000
212
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(99)00208-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm212.html#DeuberK00
2005-11-09
On-line rankings of graphs.
141-147
2000
212
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(99)00215-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm212.html#SchiermeyerTV00
2005-11-09
On the reconstruction of the characteristic polynomial of a graph.
45-52
2000
212
Discrete Mathematics
1-2
http://dx.doi.org/10.1016/S0012-365X(99)00207-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm212.html#Cvetkovic00
2005-11-09
The Clar covering polynomial of hexagonal systems III.
261-269
2000
212
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(99)00293-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm212.html#ZhangZ00
2005-11-09
Triangle-factors in a balanced blown-up triangle.
249-254
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00324-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#Johansson00a
2005-11-09
Variations on Ringel's earth-moon problem.
233-242
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00278-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#JacksonR00
2005-11-09
A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type.
229-232
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)90280-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#HongS00
2005-11-09
Equations of tournaments are not finitely based.
243-248
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00155-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#JezekMMM00
2005-11-09
Recursive constructions for cyclic quasiframes and cyclically resolvable cyclic Steiner 2-designs.
135-152
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00141-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#MishimaJ00
2005-11-09
<sub>k</sub>-factorization of symmetric complete tripartite digraphs.
281-286
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00154-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#Ushio00a
2005-11-09
On the girth of digraphs.
167-181
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00323-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#Shen00a
2005-11-09
Largest parallelotopes contained in simplices.
111-123
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00138-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#LengZM00
2005-11-09
Degree sequence conditions for maximally edge-connected graphs depending on the clique number.
217-223
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00279-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#DankelmannV00
2005-11-09
Restrained domination in trees.
1-9
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00036-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#DomkeHHM00
2005-11-09
<i>n</i><i>2n</i><i>n</i>.
53-74
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00134-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#GrantR00
2005-11-09
FCC versus HCP via parametric density.
269-274
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00158-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#Schnell00
2005-11-09
Some formulae for partitions into squares.
225-228
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00159-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#Hirschhorn00
2005-11-09
On a matching problem in the plane.
183-195
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00201-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#DumitrescuS00
2005-11-09
Equational characterizations of Boolean function classes.
27-51
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00132-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#EkinFHH00
2005-11-09
Optimal packings of edge-disjoint odd cycles.
197-202
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00283-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#BergeR00
2005-11-09
Nordhaus-Gaddum results for CO-irredundance in graphs.
209-215
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00282-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#CockayneMM00
2005-11-09
alpha-Domination.
11-26
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00131-4
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#DunbarHLM00
2005-11-09
On infinite bridged graphs and strongly dismantlable graphs.
153-166
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00142-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#Polat00
2005-11-09
Sur les anagrammes alternés.
103-110
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00238-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#KrewerasD00
2005-11-09
Congruences for the partition function in certain arithmetic progressions.
275-280
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00160-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#Urroz00
2005-11-09
On the choosability of complete multipartite graphs with part size three.
255-259
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00157-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#Kierstead00a
2005-11-09
A determinant property of Catalan numbers.
125-133
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00140-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#MaysW00
2005-11-09
On Kotzig's conjecture concerning graphs with a unique regular path-connectivity.
287-298
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00153-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#YangLWL00
2005-11-09
<sub>t</sub><sub>t, t</sub>.
263-268
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00105-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#Rho00
2005-11-09
Triangle-free graphs with large chromatic numbers.
261-262
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00109-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#Nilli00
2005-11-09
On optimal orientations of cartesian products of graphs (ii): complete graphs and even cycles.
75-102
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00136-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#KohT00a
2005-11-09
Endo-circulant digraphs of degree two and Cayley digraphs on finite abelian groups.
203-208
2000
211
Discrete Mathematics
http://dx.doi.org/10.1016/S0012-365X(99)00281-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm211.html#BrunatM00
2005-11-09
Symbolic integration of meromorphic differential systems via Dirichlet functions.
87-116
2000
210
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00124-7
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm210.html#MinhJ00
2005-11-09
Special formal series solutions of linear operator equations.
3-25
2000
210
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00118-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm210.html#AbramovPR00
2005-11-09
Some polynomials associated with up-down permutations.
117-136
2000
210
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00122-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm210.html#Johnson00
2005-11-09
Lyndon factorization of sturmian words.
137-149
2000
210
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00123-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm210.html#Melancon00
2005-11-09
<i>D</i>.
27-54
2000
210
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00119-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm210.html#FeichtnerK00
2005-11-09
An alternative method for q-counting directed column-convex polyominoes.
55-70
2000
210
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00120-X
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm210.html#Feretic00
2005-11-09
Summation theorems for multidimensional basic hypergeometric series by determinant evaluations.
151-169
2000
210
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00125-9
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm210.html#Schlosser00
2005-11-09
<i>A</i>-hypergeometric series.
171-181
2000
210
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00126-0
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm210.html#Sturmfels00
2005-11-09
Stack words, standard Young tableaux, permutations with forbidden subsequences and planar maps.
71-85
2000
210
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(99)00121-1
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm210.html#Guibert00
2005-11-09
Exponents of vertex-transitive digraphs.
245-255
2000
212
Discrete Mathematics
3
http://dx.doi.org/10.1016/S0012-365X(99)00291-5
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm212.html#ShenG00
2006-03-30
A result on Vizing's conjecture.
363-366
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2003.09.003
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#Sun04a
2006-11-01
Divisibility of certain coefficients of the chromatic polynomials.
311-317
2004
275
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2003.05.007
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm275.html#DongKS04
2006-03-30
MV-algebras with operators (the commutative and the non-commutative case).
41-76
2004
274
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00080-3
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm274.html#FlondorL04
2006-03-30
Affinely recursive sets and orderings of languages.
147-159
2004
274
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00085-2
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm274.html#Kimberling04
2006-03-30
<i>k</i>-domination numbers of graphs.
303-310
2004
274
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/S0012-365X(03)00203-6
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm274.html#Li04b
2006-03-30
Maximum face-constrained coloring of plane graphs.
233-240
2004
274
Discrete Mathematics
1-3
http://dx.doi.org/10.1016/j.disc.2003.09.001
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm274.html#RamamurthiW04
2006-06-26
Competition-reachability of a graph.
580-590
2006
306
Discrete Mathematics
6
http://dx.doi.org/10.1016/j.disc.2006.01.020
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#SeoS06
2006-06-26
The number of distinct symbols in sections of rectangular arrays.
254-261
2006
306
Discrete Mathematics
2
http://dx.doi.org/10.1016/j.disc.2005.10.024
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#SteinS06
2006-06-26
<i>theta</i><sub><i>E</i></sub><i>G</i><i>theta</i><sub><i>E</i></sub><i>G</i><sup><i>m</i></sup>).
738-744
2006
306
Discrete Mathematics
8-9
http://dx.doi.org/10.1016/j.disc.2005.11.024
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#ChoKL06
2006-06-26
<i>C</i><sub><i>p</i></sub>-decompositions of some regular graphs.
429-451
2006
306
Discrete Mathematics
4
http://dx.doi.org/10.1016/j.disc.2005.08.006
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#ManikandanP06
2006-06-26
On the oriented chromatic number of graphs with given excess.
1342-1350
2006
306
Discrete Mathematics
13
http://dx.doi.org/10.1016/j.disc.2005.12.023
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#DolamaS06
2006-06-26
Enumeration of M-partitions.
694-698
2006
306
Discrete Mathematics
7
http://dx.doi.org/10.1016/j.disc.2006.02.010
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Rodseth06
2006-06-26
<i>Z</i><sub>3</sub><i>Z</i><sub>3</sub>-connectivity.
26-30
2006
306
Discrete Mathematics
1
http://dx.doi.org/10.1016/j.disc.2005.10.019
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#DeVosXY06
2006-06-26
Restricted signed permutations counted by the Schröder numbers.
552-563
2006
306
Discrete Mathematics
6
http://dx.doi.org/10.1016/j.disc.2006.01.013
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Egge06
2006-06-26
<i>r</i>-self-orthogonal Latin squares.
124-146
2006
306
Discrete Mathematics
1
http://dx.doi.org/10.1016/j.disc.2005.11.012
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#XuC06
2006-06-26
Weak acyclic coloring and asymmetric coloring games.
673-677
2006
306
Discrete Mathematics
7
http://dx.doi.org/10.1016/j.disc.2004.07.042
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Kierstead06
2006-06-26
Listing all the minimal separators of a 3-connected planar graph.
372-380
2006
306
Discrete Mathematics
3
http://dx.doi.org/10.1016/j.disc.2005.12.007
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Mazoit06
2006-06-26
Minimal triangulations of graphs: A survey.
297-317
2006
306
Discrete Mathematics
3
http://dx.doi.org/10.1016/j.disc.2005.12.003
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Heggernes06
2006-06-26
Connectivity of Cartesian product graphs.
159-165
2006
306
Discrete Mathematics
1
http://dx.doi.org/10.1016/j.disc.2005.11.010
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#XuY06
2006-06-26
Cubic planar hamiltonian graphs of various types.
1364-1389
2006
306
Discrete Mathematics
13
http://dx.doi.org/10.1016/j.disc.2005.08.011
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#KaoHH06
2006-06-26
Profile minimization on products of graphs.
792-800
2006
306
Discrete Mathematics
8-9
http://dx.doi.org/10.1016/j.disc.2006.01.015
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#TsaoC06
2006-06-26
Self-clique Helly circular-arc graphs.
595-597
2006
306
Discrete Mathematics
6
http://dx.doi.org/10.1016/j.disc.2006.01.016
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Bonomo06
2006-06-26
Matroids with few non-common bases.
680-687
2006
306
Discrete Mathematics
7
http://dx.doi.org/10.1016/j.disc.2005.10.029
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Lemos06
2006-06-26
Preface.
293
2006
306
Discrete Mathematics
3
http://dx.doi.org/10.1016/j.disc.2005.12.004
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#BerryBS06
2006-06-26
Uncountable families of vertex-transitive graphs of finite degree.
678-679
2006
306
Discrete Mathematics
7
http://dx.doi.org/10.1016/j.disc.2006.01.021
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#LeaderM06
2006-06-26
<i>P</i><sub>4</sub>-sparse graphs.
381-392
2006
306
Discrete Mathematics
3
http://dx.doi.org/10.1016/j.disc.2005.12.008
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#NikolopoulosP06
2006-06-26
Bipartite bihypergraphs: A survey and new results.
801-811
2006
306
Discrete Mathematics
8-9
http://dx.doi.org/10.1016/j.disc.2005.10.026
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#ZverovichZ06
2006-06-26
Lex M versus MCS-M.
393-400
2006
306
Discrete Mathematics
3
http://dx.doi.org/10.1016/j.disc.2005.12.005
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Villanger06
2006-06-26
On polynomial digraphs.
401-412
2006
306
Discrete Mathematics
4
http://dx.doi.org/10.1016/j.disc.2006.01.001
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#BrunatM06
2006-06-26
Semi-hyper-connected edge transitive graphs.
705-710
2006
306
Discrete Mathematics
7
http://dx.doi.org/10.1016/j.disc.2005.11.019
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#ZhangM06
2006-06-26
Tough graphs and hamiltonian circuits.
910-917
2006
306
Discrete Mathematics
10-11
http://dx.doi.org/10.1016/j.disc.2006.03.011
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Chvatal06a
2006-06-26
Linkability in iterated line graphs.
666-669
2006
306
Discrete Mathematics
7
http://dx.doi.org/10.1016/j.disc.2005.11.018
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#BohmeKN06
2006-06-26
Factors of the Gaussian coefficients.
1446-1449
2006
306
Discrete Mathematics
13
http://dx.doi.org/10.1016/j.disc.2006.03.031
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#ChenH06
2006-06-26
On the number of minimal partitions of a box into boxes.
843-846
2006
306
Discrete Mathematics
8-9
http://dx.doi.org/10.1016/j.disc.2005.10.027
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#KisielewiczP06
2006-06-26
<sub>i</sub>) = 1 with restrictions as required by Barbeau respectively by Johnson.
1438-1439
2006
306
Discrete Mathematics
13
http://dx.doi.org/10.1016/j.disc.2005.09.017
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Burshtein06
2006-06-27
Counterexamples to Grötzsch-Sachs-Koester's conjecture.
591-594
2006
306
Discrete Mathematics
6
http://dx.doi.org/10.1016/j.disc.2005.08.010
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#DobryninM06
2006-06-26
Some sufficient conditions for a planar graph of maximum degree six to be Class 1.
1440-1445
2006
306
Discrete Mathematics
13
http://dx.doi.org/10.1016/j.disc.2006.03.032
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#BuW06
2006-06-26
Resolvable packings RtildeMP(3, 2; n, n-3) and coverings RtildeMC(3, 2; n, n-2).
1240-1246
2006
306
Discrete Mathematics
12
http://dx.doi.org/10.1016/j.disc.2006.03.005
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Cao06
2006-06-26
Consistency for partition regular equations.
847-850
2006
306
Discrete Mathematics
8-9
http://dx.doi.org/10.1016/j.disc.2005.10.030
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#LeaderR06
2006-06-26
Decomposing oriented graphs into transitive tournaments.
166-170
2006
306
Discrete Mathematics
1
http://dx.doi.org/10.1016/j.disc.2005.11.008
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Yuster06
2006-06-26
<i>K</i><sub><i>r</i></sub>-free graphs.
612-616
2006
306
Discrete Mathematics
6
http://dx.doi.org/10.1016/j.disc.2006.01.014
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Nikiforov06
2006-06-26
Spanning subgraphs with specified valencies.
932-938
2006
306
Discrete Mathematics
10-11
http://dx.doi.org/10.1016/j.disc.2006.03.014
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Tutte06
2006-06-26
Acyclic orientations of graphs.
905-909
2006
306
Discrete Mathematics
10-11
http://dx.doi.org/10.1016/j.disc.2006.03.010
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Stanley06
2006-06-26
<i>k</i>-subsets of a linearly ordered set.
413-419
2006
306
Discrete Mathematics
4
http://dx.doi.org/10.1016/j.disc.2005.12.018
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#GervacioM06
2006-06-26
List colourings of planar graphs.
1076-1079
2006
306
Discrete Mathematics
10-11
http://dx.doi.org/10.1016/j.disc.2006.03.027
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Voigt06
2006-06-26
Character sums and nonlinear recurrence sequences.
1126-1131
2006
306
Discrete Mathematics
12
http://dx.doi.org/10.1016/j.disc.2006.02.012
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#BlackburnS06
2006-06-26
On almost self-complementary graphs.
107-123
2006
306
Discrete Mathematics
1
http://dx.doi.org/10.1016/j.disc.2005.11.003
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#PotocnikS06
2006-06-26
On cycles through specified vertices.
831-835
2006
306
Discrete Mathematics
8-9
http://dx.doi.org/10.1016/j.disc.2005.12.021
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#GerlachGHT06
2006-06-26
Counting occurrences of 231 in an involution.
564-572
2006
306
Discrete Mathematics
6
http://dx.doi.org/10.1016/j.disc.2006.01.011
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#MansourYY06
2006-06-26
Covering partially directed graphs with directed paths.
1390-1404
2006
306
Discrete Mathematics
13
http://dx.doi.org/10.1016/j.disc.2006.01.024
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#RizziR06
2006-06-26
<i>G</i><sub>2</sub>.
1285-1300
2006
306
Discrete Mathematics
13
http://dx.doi.org/10.1016/j.disc.2006.01.023
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#DonnellyLP06
2006-06-26
Bifractional inequalities and convex cones.
231-243
2006
306
Discrete Mathematics
2
http://dx.doi.org/10.1016/j.disc.2005.12.013
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Niezgoda06
2006-06-26
Acyclically pushable bipartite permutation digraphs: An algorithm.
1177-1188
2006
306
Discrete Mathematics
12
http://dx.doi.org/10.1016/j.disc.2005.11.027
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Rizzi06
2006-06-26
The intricacy of avoiding arrays is 2.
531-532
2006
306
Discrete Mathematics
5
http://dx.doi.org/10.1016/j.disc.2005.11.009
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Ohman06
2006-06-26
Degree complete graphs.
533-537
2006
306
Discrete Mathematics
5
http://dx.doi.org/10.1016/j.disc.2006.01.008
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Qian06
2006-06-26
<i>q</i><i>q</i>-Gauss summation theorem.
1424-1437
2006
306
Discrete Mathematics
13
http://dx.doi.org/10.1016/j.disc.2006.01.025
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#ZhangL06
2006-06-26
Solution of two fractional packing problems of Lovász.
973-978
2006
306
Discrete Mathematics
10-11
http://dx.doi.org/10.1016/j.disc.2006.03.018
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#SchrijverS06
2006-06-26
Preface.
851-852
2006
306
Discrete Mathematics
10-11
http://dx.doi.org/10.1016/j.disc.2006.05.002
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Hammer06
2006-06-26
The treewidth and pathwidth of hypercubes.
359-365
2006
306
Discrete Mathematics
3
http://dx.doi.org/10.1016/j.disc.2005.12.011
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#ChandranK06
2006-06-26
Fast perfect sampling from linear extensions.
420-428
2006
306
Discrete Mathematics
4
http://dx.doi.org/10.1016/j.disc.2006.01.003
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Huber06
2006-06-26
<i>G(n)</i>.
711-725
2006
306
Discrete Mathematics
8-9
http://dx.doi.org/10.1016/j.disc.2006.02.006
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#CaselliM06
2006-06-26
Resolvable group divisible designs with block size four and index three.
52-65
2006
306
Discrete Mathematics
1
http://dx.doi.org/10.1016/j.disc.2005.11.005
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Ge06
2006-06-26
Some colouring problems for Paley graphs.
99-106
2006
306
Discrete Mathematics
1
http://dx.doi.org/10.1016/j.disc.2005.10.018
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#MaistrelliP06
2006-06-26
Edmonds polytopes and a hierarchy of combinatorial problems.
886-904
2006
306
Discrete Mathematics
10-11
http://dx.doi.org/10.1016/j.disc.2006.03.009
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Chvatal06
2006-06-26
A degree bound on decomposable trees.
469-477
2006
306
Discrete Mathematics
5
http://dx.doi.org/10.1016/j.disc.2006.01.006
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#BarthF06
2006-06-26
<i>t</i>-designs.
1189-1197
2006
306
Discrete Mathematics
12
http://dx.doi.org/10.1016/j.disc.2005.10.033
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Tuan06
2006-06-26
A vertex incremental approach for maintaining chordality.
318-336
2006
306
Discrete Mathematics
3
http://dx.doi.org/10.1016/j.disc.2005.12.002
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#BerryHV06
2006-06-26
Explicit construction of linear sized tolerant networks.
1068-1071
2006
306
Discrete Mathematics
10-11
http://dx.doi.org/10.1016/j.disc.2006.03.025
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#AlonC06
2006-06-26
<i>p</i><i>q</i><i>p</i><i>q</i>rectangular elements.
836-842
2006
306
Discrete Mathematics
8-9
http://dx.doi.org/10.1016/j.disc.2005.11.020
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#JepsenG06
2006-06-26
Combinatorial aspects of continued fractions.
992-1021
2006
306
Discrete Mathematics
10-11
http://dx.doi.org/10.1016/j.disc.2006.03.020
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Flajolet06
2006-06-26
A group extensions approach to affine relative difference sets of even order.
42-51
2006
306
Discrete Mathematics
1
http://dx.doi.org/10.1016/j.disc.2005.11.004
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Galati06
2006-06-26
<i>n</i><sup>2.69</sup>) time.
366-371
2006
306
Discrete Mathematics
3
http://dx.doi.org/10.1016/j.disc.2005.12.009
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#KratschS06
2006-06-26
Generating indecomposable permutations.
508-518
2006
306
Discrete Mathematics
5
http://dx.doi.org/10.1016/j.disc.2006.01.005
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#King06
2006-06-26
A contribution to queens graphs: A substitution method.
1105-1114
2006
306
Discrete Mathematics
12
http://dx.doi.org/10.1016/j.disc.2006.03.002
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#AmbrusB06
2006-06-26
Irreducible snarks of given order and cyclic connectivity.
779-791
2006
306
Discrete Mathematics
8-9
http://dx.doi.org/10.1016/j.disc.2006.02.003
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#MacajovaS06
2006-06-26
On finite matroids with two more hyperplanes than points.
199-209
2006
306
Discrete Mathematics
2
http://dx.doi.org/10.1016/j.disc.2005.10.023
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Dentice06
2006-06-26
The smallest size of a complete cap in PG(3, 7).
1257-1263
2006
306
Discrete Mathematics
13
http://dx.doi.org/10.1016/j.disc.2005.06.039
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#BierbrauerMP06
2006-06-26
Errata to "Matching properties in domination critical graphs" [Discrete Math 277 (2004) 1-13].
291
2006
306
Discrete Mathematics
2
http://dx.doi.org/10.1016/j.disc.2005.12.014
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#AnanchuenP06
2006-06-26
On resolvable designs.
876-885
2006
306
Discrete Mathematics
10-11
http://dx.doi.org/10.1016/j.disc.2006.03.008
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#HananiRW06
2006-06-26
Latin hypercubes and MDS codes.
1232-1239
2006
306
Discrete Mathematics
12
http://dx.doi.org/10.1016/j.disc.2006.02.011
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Soedarmadji06
2006-06-26
<i>q</i>-analog of the exponential formula.
1022-1031
2006
306
Discrete Mathematics
10-11
http://dx.doi.org/10.1016/j.disc.2006.03.021
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Gessel06
2006-06-26
A note on class one graphs with maximum degree six.
1450-1455
2006
306
Discrete Mathematics
13
http://dx.doi.org/10.1016/j.disc.2006.02.007
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#LiLN06
2006-06-26
Uniformly cordial graphs.
726-737
2006
306
Discrete Mathematics
8-9
http://dx.doi.org/10.1016/j.disc.2005.11.025
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#ChartrandLZ06
2006-06-26
Extremal problems among subsets of a set.
923-931
2006
306
Discrete Mathematics
10-11
http://dx.doi.org/10.1016/j.disc.2006.03.013
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#ErdosK06
2006-06-26
The completeness problem in partial hyperclones.
1405-1414
2006
306
Discrete Mathematics
13
http://dx.doi.org/10.1016/j.disc.2005.11.033
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Romov06
2006-06-26
Tessellating polyominos in the plane.
1139-1144
2006
306
Discrete Mathematics
12
http://dx.doi.org/10.1016/j.disc.2005.11.026
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#ChenHY06
2006-06-26
<i>A</i><i>p(A, n)</i><i>n</i>large enough.
1115-1125
2006
306
Discrete Mathematics
12
http://dx.doi.org/10.1016/j.disc.2005.11.022
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#SaidLN06
2006-06-26
Bartholdi zeta functions of some graphs.
220-230
2006
306
Discrete Mathematics
2
http://dx.doi.org/10.1016/j.disc.2005.08.007
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#MizunoS06
2006-06-26
The metric dimension of Cayley digraphs.
31-41
2006
306
Discrete Mathematics
1
http://dx.doi.org/10.1016/j.disc.2005.09.015
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#FehrGO06
2006-06-26
Normal hypergraphs and the perfect graph conjecture.
867-875
2006
306
Discrete Mathematics
10-11
http://dx.doi.org/10.1016/j.disc.2006.03.007
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Lovasz06
2006-06-26
Limit distribution for the existence of Hamiltonian cycles in a random graph.
1032-1038
2006
306
Discrete Mathematics
10-11
http://dx.doi.org/10.1016/j.disc.2006.03.022
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#KomlosS06
2006-06-26
A survey on labeling graphs with a condition at distance two.
1217-1231
2006
306
Discrete Mathematics
12
http://dx.doi.org/10.1016/j.disc.2005.11.029
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Yeh06
2006-06-26
<i>q</i>-Dyson conjecture.
1039-1059
2006
306
Discrete Mathematics
10-11
http://dx.doi.org/10.1016/j.disc.2006.03.023
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#ZeilbergerB06
2006-06-26
Bias matroids with unique graphical representations.
1253-1256
2006
306
Discrete Mathematics
12
http://dx.doi.org/10.1016/j.disc.2006.03.003
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Slilaty06
2006-06-26
A construction of non self-orthogonal designs.
147-152
2006
306
Discrete Mathematics
1
http://dx.doi.org/10.1016/j.disc.2005.11.011
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Nakasora06
2006-06-26
On the role of hypercubes in the resonance graphs of benzenoid graphs.
699-704
2006
306
Discrete Mathematics
7
http://dx.doi.org/10.1016/j.disc.2005.11.017
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#SalemKG06
2006-06-26
Spanning trails containing given edges.
87-98
2006
306
Discrete Mathematics
1
http://dx.doi.org/10.1016/j.disc.2005.10.022
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#LuoCC06
2006-06-26
A new bound for neighbor-connectivity of Abelian Cayley graphs.
1301-1316
2006
306
Discrete Mathematics
13
http://dx.doi.org/10.1016/j.disc.2005.09.018
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Doty06
2006-06-26
Disjoint paths in graphs.
979-991
2006
306
Discrete Mathematics
10-11
http://dx.doi.org/10.1016/j.disc.2006.03.019
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Seymour06
2006-06-26
Extended directed triple systems.
1351-1357
2006
306
Discrete Mathematics
13
http://dx.doi.org/10.1016/j.disc.2005.12.022
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Huang06
2006-06-28
On the degrees of a strongly vertex-magic graph.
539-551
2006
306
Discrete Mathematics
6
http://dx.doi.org/10.1016/j.disc.2006.01.019
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#BalbuenaBDLMRSST06
2006-06-26
Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers.
262-270
2006
306
Discrete Mathematics
2
http://dx.doi.org/10.1016/j.disc.2005.08.009
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Wang06
2006-06-26
Contributions to zero-sum problems.
1-10
2006
306
Discrete Mathematics
1
http://dx.doi.org/10.1016/j.disc.2005.11.002
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#AdhikariCFKP06
2006-06-26
Bounds for the b-chromatic number of some families of graphs.
617-623
2006
306
Discrete Mathematics
7
http://dx.doi.org/10.1016/j.disc.2006.01.012
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#KouiderZ06
2006-06-26
Chromatic characterization of biclique covers.
495-507
2006
306
Discrete Mathematics
5
http://dx.doi.org/10.1016/j.disc.2006.01.010
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#CornazF06
2006-06-26
On the bondage number of planar and directed graphs.
820-826
2006
306
Discrete Mathematics
8-9
http://dx.doi.org/10.1016/j.disc.2006.02.008
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#CarlsonD06
2006-06-26
Automorphism groups of graphs and edge-contraction.
918-922
2006
306
Discrete Mathematics
10-11
http://dx.doi.org/10.1016/j.disc.2006.03.012
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Babai06
2006-06-26
An Erdös-Ko-Rado theorem for partial permutations.
74-86
2006
306
Discrete Mathematics
1
http://dx.doi.org/10.1016/j.disc.2005.11.007
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#KuL06
2006-06-26
On integral sum graphs.
19-25
2006
306
Discrete Mathematics
1
http://dx.doi.org/10.1016/j.disc.2005.10.021
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Chen06
2006-06-26
On acyclic colorings of planar graphs.
953-972
2006
306
Discrete Mathematics
10-11
http://dx.doi.org/10.1016/j.disc.2006.03.017
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Borodin06
2006-06-26
Stirling number representations.
478-494
2006
306
Discrete Mathematics
5
http://dx.doi.org/10.1016/j.disc.2005.11.013
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Branson06
2006-06-26
Restricted even permutations and Chebyshev polynomials.
1161-1176
2006
306
Discrete Mathematics
12
http://dx.doi.org/10.1016/j.disc.2006.03.001
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Mansour06
2006-06-26
On geodesic structures of weakly median graphs I. Decomposition and octahedral graphs.
1272-1284
2006
306
Discrete Mathematics
13
http://dx.doi.org/10.1016/j.disc.2005.10.034
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#ChastandP06
2006-06-26
Double perfect partitions.
519-525
2006
306
Discrete Mathematics
5
http://dx.doi.org/10.1016/j.disc.2006.01.007
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Lee06
2006-06-26
<i>Theta</i>-graceful labelings of partial cubes.
1264-1271
2006
306
Discrete Mathematics
13
http://dx.doi.org/10.1016/j.disc.2006.02.013
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#BresarK06
2006-06-26
<i>a</i><i>b</i>]-factors.
688-693
2006
306
Discrete Mathematics
7
http://dx.doi.org/10.1016/j.disc.2006.01.018
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Matsuda06
2006-06-26
Partition the vertices of a graph into one independent set and one acyclic set.
1207-1216
2006
306
Discrete Mathematics
12
http://dx.doi.org/10.1016/j.disc.2005.09.016
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#YangY06
2006-06-26
Erratum to: "Some results related to the toughness of 3-domination critical graphs" [Discrete Math 272 (2003) 5-15].
292
2006
306
Discrete Mathematics
2
http://dx.doi.org/10.1016/j.disc.2005.12.015
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#AnanchuenP06a
2006-06-26
Some remarks about leaf roots.
1456-1461
2006
306
Discrete Mathematics
13
http://dx.doi.org/10.1016/j.disc.2006.03.030
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Rautenbach06
2006-06-26
A fast algorithm for proving terminating hypergeometric identities.
1072-1075
2006
306
Discrete Mathematics
10-11
http://dx.doi.org/10.1016/j.disc.2006.03.026
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#Zeilberger06
2006-06-26
<i>k</i>with non-cyclic vertex stabilizer.
464-468
2006
306
Discrete Mathematics
4
http://dx.doi.org/10.1016/j.disc.2006.01.002
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#KwakO06
2006-06-26
<i>NP</i>-hardness of the clique partition - Independence number gap recognition and related problems.
460-463
2006
306
Discrete Mathematics
4
http://dx.doi.org/10.1016/j.disc.2006.01.004
http://www.informatik.uni-trier.de/~ley/db/journals/dm/dm306.html#BusyginP06