default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 167-168
Volume 167-168, April 1997
- Douglas R. Woodall:
Preface. 1-2 - Francesc Aguiló, Miguel Angel Fiol, C. Garcia:
Triple loop networks with small transmission delay. 3-16 - Lars Døvling Andersen, Anthony J. W. Hilton:
Triangulations of 3-way regular tripartite graphs of degree 4, with applications to orthogonal latin squares. 17-34 - Kiyoshi Ando, Yoshimi Egawa:
The minimum number of edges in a vertex diameter-2-critical graph. 35-63 - Rosemary A. Bailey:
A Howell design admitting A51. 65-71 - Rosemary A. Bailey, Polycarp E. Chigbu:
Enumeration of semi-Latin squares. 73-84 - Camino Balbuena, Ángeles Carmona, Josep Fàbrega
, Miguel Angel Fiol:
Extraconnectivity of graphs with large minimum degree and girth. 85-100 - Jørgen Bang-Jensen, Yubao Guo, Gregory Z. Gutin, Lutz Volkmann:
A classification of locally semicomplete digraphs. 101-114 - Bruce L. Bauslaugh:
Compactness and finite equivalence of infinite digraphs. 115-126 - Lowell W. Beineke, Michael A. Henning:
Opinion functions on trees. 127-139 - Andrew Bowler:
Orthomorphisms of dihedral groups. 141-144 - Richard C. Brewster, Pavol Hell, Gary MacGillivray:
The complexity of restricted graph homomorphisms. 145-154 - Haitze J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer:
Dirac's minimum degree condition restricted to claws. 155-166 - Darryn E. Bryant, Sheila Oates-Williams:
Strongly 2-perfect cycle systems and their quasigroups. 167-174 - Peter J. Cameron:
On the probability of connectedness. 175-187 - Anton Cerný, Peter Horák, Walter D. Wallis:
Kirkman's school projects. 189-196 - William W. Chernoff:
Interwoven polygonal frames. 197-204 - Ernest J. Cockayne, Christina M. Mynhardt:
Domination and irredundance in cubic graphs. 205-214 - Peter I. Cowling:
The total graph of a hypergraph. 215-236 - Gayla S. Domke, Jean E. Dunbar, Lisa R. Markus:
Gallai-type theorems and domination parameters. 237-248 - Gayla S. Domke, Renu C. Laskar:
The bondage and reinforcement numbers of gammaf for some graphs. 249-259 - Jean E. Dunbar, Jerrold W. Grossman, Johannes H. Hattingh, Stephen T. Hedetniemi, Alice A. McRae:
On weakly connected domination in graphs. 261-269 - Jonathan David Farley:
Perfect sequences of chain-complete posets. 271-296 - Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra:
The alternating polynomials and their relation with the spectra and conditional diameters of graphs. 297-307 - Willem L. Fouché:
Symmetry and the Ramsey degree of posets. 309-315 - Dalibor Froncek:
Almost self-complementary factors of complete bipartite graphs. 317-327 - Wayne Goddard, Michael D. Plummer, Henda C. Swart:
Maximum and minimum toughness of graphs of small genus. 329-339 - Mike J. Grannell, Terry S. Griggs, J. P. Murphy:
Twin Steiner triple systems. 341-352 - Yubao Guo:
Path-connectivity in local tournaments. 353-372 - Stuart G. Hoggar:
Weight enumerators of codes derived from polynomial product algorithms. 373-391 - Wilfried Imrich, Tomaz Pisanski, Janez Zerovnik:
Recognizing Cartesian graph bundles. 393-403 - Derek Jennings, Kevin Byard:
An extension for residue difference sets. 405-410 - Khee Meng Koh, B. P. Tan:
The number of kings in a multipartite tournament. 411-418 - Cristian Lenart, Nigel Ray:
Chromatic polynomials of partition systems. 419-444 - Richard P. Lewis:
The ranks of partitions modulo 2. 445-449 - Ebadollah S. Mahmoodian, Reza Naserasr, Manouchehr Zaker:
Defining sets in vertex colorings of graphs and latin rectangles. 451-460 - Nigel Martin:
Complete bipartite factorisations by complete bipartite graphs. 461-480 - Colin McDiarmid:
Hypergraph colouring and the Lovász Local Lemma. 481-486 - John W. Moon:
On the number of induced subgraphs of trees. 487-496 - Mikhail E. Muzychuk:
On Ádám's conjecture for circulant graphs. 497-510 - Victor Neumann-Lara, Eduardo Rivera-Campo:
Euler tours and a game with dominoes. 511-517 - P. J. Owens, Donald A. Preece:
Aspects of complete sets of 9 × 9 pairwise orthogonal latin squares. 519-525 - Donald A. Preece:
Some 6 × 11 Youden squares and double Youden rectangles. 527-541 - Ronald C. Read:
Combinatorial problems in the theory of music. 543-551 - P. A. Sinclair:
The construction and reduction of strong snarks. 553-570 - D. H. Smith, Steve Hurley:
Bounds for the frequency assignment problem. 571-582 - Conrad Johann Swanepoel, Lourens M. Pretorius:
Factor-complement partitions of ascending k-parameter words. 583-592 - Kazuhiko Ushio:
Star-factorization of symmetric complete bipartite digraphs. 593-596 - Alain Valette:
An application of Ramanujan graphs to C*-algebra tensor products. 597-603
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 2025-12-01 23:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
