The star-arboricity of the complete regular multipartite graphsAOKI, Y.Discrete mathematics. 1990, Vol 81, Num 2, pp 115-122, issn 0012-365X, 8 p.Article

Hamilton cycles in regular 2-connected graphsBONDY, J. A; KOUIDER, M.Journal of combinatorial theory. Series B. 1988, Vol 44, Num 2, pp 177-186, issn 0095-8956Article

Sur la contraction des graphes orientés en K₃* = On the contraction of directed graphs onto K₃*DUCHET, P; KANETI, V.Discrete mathematics. 1987, Vol 65, Num 1, pp 95-98, issn 0012-365XArticle

3-connected line graphs of triangular graphs are panconnected and 1-hamiltonianBROERSMA, H. J; VELDMAN, H. J.Journal of graph theory. 1987, Vol 11, Num 3, pp 399-407, issn 0364-9024Article

On critically connected digraphsMADER, W.Journal of graph theory. 1989, Vol 13, Num 4, pp 513-522, issn 0364-9024Article

Regular totally domatically full graphsZELINSKA, B.Discrete mathematics. 1990, Vol 86, Num 1-3, pp 71-79, issn 0012-365X, 9 p.Article

Reduced graphs of diameter twoHONG-JIAN LAI.Journal of graph theory. 1990, Vol 14, Num 1, pp 77-87, issn 0364-9024Article

Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphsROSENFELD, M.Aequationes mathematicae (Printed ed.). 1989, Vol 38, Num 1, pp 50-55, issn 0001-9054Article

The number of matchings in random regular graphs and bipartite graphsBOLLOBAS, B; MCKAY, B. D.Journal of combinatorial theory. Series B. 1986, Vol 41, Num 1, pp 80-91, issn 0095-8956Article

The continuous center set of a networkHANSEN, P; LABBE, M; NICOLAS, B et al.Discrete applied mathematics. 1991, Vol 30, Num 2-3, pp 181-195, issn 0166-218X, 15 p.Article

Universal sequences for complete graphsALON, N; AZAR, Y; RAVID, Y et al.Discrete applied mathematics. 1990, Vol 27, Num 1-2, pp 25-28, issn 0166-218XConference Paper

An infinite family of 4-arc-transitive cubic graphs each with grith 12CONDER, M.Bulletin of the London Mathematical Society. 1989, Vol 21, Num 91, pp 375-380, issn 0024-6093, part 4Article

Non-Hamiltonian bicubic graphsGEORGES, J. P.Journal of combinatorial theory. Series B. 1989, Vol 46, Num 1, pp 121-124, issn 0095-8956Article

Contractions and Hamiltonian line graphsHONG-JIAN LAI.Journal of graph theory. 1988, Vol 12, Num 1, pp 11-15, issn 0364-9024Article

The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 verticesHOLTON, D. A; MCKAY, B. D.Journal of combinatorial theory. Series B. 1988, Vol 45, Num 3, pp 305-319, issn 0095-8956Article

The generalized Petersen graph G(24, 5)COXETER, H. S. M.Computers & mathematics with applications. Part B. 1986, Vol 12, Num 3-4, pp 579-583Article

On F-geodetic graphsSCAPELLATO, R.Discrete mathematics. 1990, Vol 80, Num 3, pp 313-325, issn 0012-365XArticle

Embedding rectilinear graphs in linear timeHOFFMANN, F; KRIEGEL, K.Information processing letters. 1988, Vol 29, Num 2, pp 75-79, issn 0020-0190Article

Fast parallel strong orientation of mixed graphs and related augmentation problemsSOROKER, D.Journal of algorithms (Print). 1988, Vol 9, Num 3, pp 205-223, issn 0196-6774Article

Hamiltonian cycles in vertex symmetric graphs of order 2p²MARUSIC, D.Discrete mathematics. 1987, Vol 66, Num 1-2, pp 169-174, issn 0012-365XArticle

Classification of 4- and 5-arc-transitive cubic graphs of small girthMORTON, M. J.Journal of the Australian Mathematical Society. Series A, Pure mathematics. 1991, Vol 50, Num 1, pp 138-149, issn 0334-3316, 12 p.Article

Möbius inversion of random acyclic directed graphsCOHEN, J. E.Studies in applied mathematics (Cambridge). 1991, Vol 84, Num 1, pp 1-6, issn 0022-2526, 6 p.Article

4-critical 4-valent planar graphs constructed with crownsKOESTER, G.Mathematica scandinavica. 1990, Vol 67, Num 1, pp 15-22, issn 0025-5521, 8 p.Article

Matching cutsets in graphsMOSHI, A. M.Journal of graph theory. 1989, Vol 13, Num 5, pp 527-536, issn 0364-9024, 10 p.Article

Vertex domination-critical graphsBRIGHAM, R. C; CHINN, P. Z; DUTTON, R. D et al.Networks (New York, NY). 1988, Vol 18, Num 3, pp 173-179, issn 0028-3045Article