Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 231
Volume 231, Number 1-3, March 2001
- Douglas R. Woodall:
Preface. 1-2 - Vito Abatangelo, Gábor Korchmáros
, Bambina Larato:
Transitive parabolic unitals in translation planes of odd order. 3-10 - R. Julian R. Abel, Frank E. Bennett, Hantao Zhang, Lie Zhu:
Steiner pentagon covering designs. 11-26 - Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Abdollah Khodkar:
The mu-way intersection problem for m-cycle systems. 27-56 - Francesc Aguiló, I. Diego:
Discrete dynamics over double commutative-step digraphs. 57-72 - Robert E. L. Aldred, Michael D. Plummer:
On restricted matching extension in planar graphs. 73-79 - David Bedford, Matthew A. Ollis, Roger M. Whitaker:
On bipartite tournaments balanced with respect to carry-over effects for both teams. 81-87 - David Bedford, Roger M. Whitaker:
Bounds on the maximum number of Latin squares in a mutually quasi-orthogonal set. 89-96 - Halina Bielak:
Roots of chromatic polynomials. 97-102 - Anthony Bonato, Kathie Cameron:
On an adjacency property of almost all graphs. 103-119 - Robin Chapman:
An involution on derangements. 121-122 - Ernest J. Cockayne, Odile Favaron, Paul J. P. Grobler, Christina M. Mynhardt, Joël Puech:
Ramsey properties of generalised irredundant sets in graphs. 123-134 - Paul Erdös, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel:
Edge disjoint monochromatic triangles in 2-colored graphs. 135-141 - Odile Favaron, Michael A. Henning, Joël Puech, Dieter Rautenbach:
On domination and annihilation in graphs with claw-free blocks. 143-151 - Ramón M. Figueroa-Centeno, Rikio Ichishima, Francesc A. Muntaner-Batle:
The place of super edge-magic labelings among other classes of labelings. 153-168 - Willem L. Fouché, Lourens M. Pretorius, Conrad Johann Swanepoel:
Partitions of factorisations of parameter words. 169-175 - Joan Gimbert:
Enumeration of almost Moore digraphs of diameter two. 177-190 - Ronald J. Gould, Michael S. Jacobson:
Two-factors with few cycles in claw-free graphs. 191-197 - Mike J. Grannell, Terry S. Griggs, Fred C. Holroyd:
Modular gracious labellings of trees. 199-219 - Paul J. P. Grobler, Christina M. Mynhardt:
Domination parameters and edge-removal-critical graphs. 221-239 - Heiko Harborth, Ingrid Mengersen:
Ramsey numbers in octahedron graphs. 241-246 - Lars Hellström:
Algebraic dependence of commuting differential operators. 247-252 - Anthony J. W. Hilton, Tomaz Slivnik, David S. G. Stirling:
Aspects of edge list-colourings. 253-264 - Thomas Honold, Ivan N. Landjev:
On arcs in projective Hjelmslev planes. 265-278 - Jing Huang, Gary MacGillivray, Kathryn L. B. Wood:
Pushing the cycles out of multipartite tournaments. 279-287 - Leif K. Jørgensen:
Directed strongly regular graphs with mu=lambda. 289-293 - A. Donald Keedwell:
A characterization of the Jacobi logarithms of a finite field. 295-302 - Domenico Labbate:
On 3-cut reductions of minimally 1-factorable cubic bigraphs. 303-310 - Guizhen Liu, Qinglin Yu:
Generalization of matching extensions in graphs. 311-320 - Per Håkan Lundow:
Compression of transfer matrices. 321-329 - Gary MacGillivray, A. Rodriguez:
The achromatic number of the union of paths. 331-335 - Sònia P. Mansilla, Oriol Serra:
Construction of k-arc transitive digraphs. 337-349 - John P. Morgan, Donald A. Preece, David H. Rees:
Nested balanced incomplete block designs. 351-389 - Stephanie Perkins, Adrian Escott:
Extended synchronizing codewords for q-ary complete prefix codes. 391-401 - Nicholas C. K. Phillips:
Finding tight single-change covering designs with v=20, k=5. 403-409 - Dieter Rautenbach:
On vertex orderings and the stability number in triangle-free graphs. 411-420 - Robert Shrock:
Chromatic polynomials and their zeros and asymptotic limits for families of graphs. 421-446 - Angelo Sonnino:
One-factorizations of complete multigraphs arising from maximal (k;n)-arcs in PG(2, 2h). 447-451 - Meike Tewes, Lutz Volkmann:
The ratio of the longest cycle and longest path in semicomplete multipartite digraphs. 453-457 - Kazuhiko Ushio, Yoshikazu Ohtsubo:
Kp, q-factorization of symmetric complete tripartite digraphs. 459-467
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-17 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
