Generating strings for bipartite Steinhaus graphs (English)
- New search for: Dymàcek, W.M.
- New search for: Dymàcek, W.M.
- New search for: Whaley, T.
In:
Discrete mathematics
;
141
, 1-3
; 95-108
;
1995
-
ISSN:
- Article (Journal) / Print
-
Title:Generating strings for bipartite Steinhaus graphs
-
Contributors:Dymàcek, W.M. ( author ) / Whaley, T.
-
Published in:Discrete mathematics ; 141, 1-3 ; 95-108
-
Publisher:
- New search for: Elsevier
-
Place of publication:Amsterdam [u.a.]
-
Publication date:1995
-
ISSN:
-
ZDBID:
-
Type of media:Article (Journal)
-
Type of material:Print
-
Language:English
- New search for: 31.12 / 31.20 / 31.10
- Further information on Basic classification
- New search for: 535/3100
-
Keywords:
-
Classification:
-
Source:
Table of contents – Volume 141, Issue 1-3
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Long cycles in graphs with prescribed toughness and minimum degreeBauer, D. et al. | 1995
- 11
-
Generalisations of the Andrews-Olsson partition identity and applicationsBessenrodt, C. et al. | 1995
- 23
-
An extension theorem for Steiner systemsBlanchard, J.L. et al. | 1995
- 37
-
Vertex arboricity and maximum degreeCatlin, P.A. et al. | 1995
- 47
-
Chessboard squaresChetwynd, A.G. et al. | 1995
- 61
-
The achromatic indices of the regular complete multipartite graphsChiang, N.-P. et al. | 1995
- 67
-
There are no edge-chromatic 4-critical graphs of order 12Choudum, S.A. et al. | 1995
- 75
-
A characterisation of universal minimal total dominating functions in treesCockayne, E.J. et al. | 1995
- 85
-
The r-depth of a matroidDias da Silva, J.A. et al. | 1995
- 95
-
Generating strings for bipartite Steinhaus graphsDymàcek, W.M. et al. | 1995
- 109
-
Degree conditions and cycle extendabilityFaudree, R.J. et al. | 1995
- 123
-
On congruence in Zn and the dimension of a multidimensional circulantFiol, M.A. et al. | 1995
- 135
-
Complexity of circuit intersection in graphsFraenkel, A.S. et al. | 1995
- 153
-
Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphsGutin, G. et al. | 1995
- 163
-
A family of sparse graphs of large sum numberHartsfield, N. et al. | 1995
- 173
-
The isomorphism problem for Cayley digraphs on groups of prime-squared orderJoseph, A. et al. | 1995
- 185
-
The size of k-pseudotreesKnill, E. et al. | 1995
- 195
-
A nonorientable triangular embedding of K~n-K~2, n8 (mod 12)Korzhik, V. P. et al. | 1995
- 195
-
A nonorientable triangular embedding of Kn-K2, n (equivalent) 8 (mod 12)Korzhik, V.P. et al. | 1995
- 213
-
Neighborhood unions and hamiltonicity of graphsShen, R. et al. | 1995
- 227
-
On edge transitivity of directed graphsSzwarcfiter, J.L. et al. | 1995
- 237
-
Boolean minorsWang, C. et al. | 1995
- 259
-
Steiner minimal trees on regular polygons with centreWeng, J.F. et al. | 1995
- 275
-
Two new symmetric inseparable double squaresBao, X. et al. | 1995
- 279
-
The irregular coloring number of a treeBurris, A.C. et al. | 1995
- 285
-
Degree sequence and independence in K(4)-free graphsErdos, P. et al. | 1995
- 291
-
A six-color theorem for the edge-face coloring of plane graphsLin, C. et al. | 1995
- 299
-
Author index to Volume 141| 1995