default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 141
Volume 141, Numbers 1-3, June 1995
- Douglas Bauer, Haitze J. Broersma
, Jan van den Heuvel, Henk Jan Veldman:
Long cycles in graphs with prescribed toughness and minimum degree. 1-10 - Christine Bessenrodt:
Generalisations of the Andrews-Olsson partition identity and applications. 11-22 - John L. Blanchard:
An extension theorem for Steiner systems. 23-35 - Paul A. Catlin, Hong-Jian Lai:
Vertex arboricity and maximum degree. 37-46 - Amanda G. Chetwynd, Susan J. Rhodes:
Chessboard squares. 47-59 - Nam-Po Chiang, Hung-Lin Fu:
The achromatic indices of the regular complete multipartite graphs. 61-66 - Sheshayya A. Choudum, K. Kayathri:
There are no edge-chromatic 4-critical graphs of order 12. 67-73 - Ernest J. Cockayne, Christina M. Mynhardt:
A characterisation of universal minimal total dominating functions in trees. 75-84 - J. A. Dias da Silva, Amélia Fonseca:
The r-depth of a matroid. 85-93 - Wayne M. Dymàcek, Tom Whaley:
Generating strings for bipartite Steinhaus graphs. 95-107 - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Degree conditions and cycle extendability. 109-122 - Miguel Angel Fiol:
On congruence in Zn and the dimension of a multidimensional circulant. 123-134 - Aviezri S. Fraenkel, Martin Loebl:
Complexity of circuit intersection in graphs. 135-151 - Gregory Z. Gutin:
Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs. 153-162 - Nora Hartsfield, W. F. Smyth:
A family of sparse graphs of large sum number. 163-171 - Anne Joseph:
The isomorphism problem for Cayley digraphs on groups of prime-squared order. 173-183 - Emanuel Knill, Andrzej Ehrenfeucht, David Haussler:
The size of k-pseudotrees. 185-194 - Vladimir P. Korzhik:
A nonorientable triangular embedding of Kn-K2, n=8 (mod 12). 195-211 - Ruqun Shen, Feng Tian:
Neighborhood unions and hamiltonicity of graphs. 213-225 - Jayme Luiz Szwarcfiter:
On edge transitivity of directed graphs. 227-235 - Chi Wang:
Boolean minors. 237-258 - J. F. Weng, R. S. Booth:
Steiner minimal trees on regular polygons with centre. 259-274 - Xiaomin Bao:
Two new symmetric inseparable double squares. 275-277 - Anita C. Burris:
The irregular coloring number of a tree. 279-283 - Paul Erdös, Ralph J. Faudree, Talmage James Reid, Richard H. Schelp, William Staton:
Degree sequence and independence in K(4)-free graphs. 285-290 - Cuiqin Lin, Guanzhang Hu, Zhongfu Zhang:
A six-color theorem for the edge-face coloring of plane graphs. 291-297
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-10-12 22:49 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:
