Factorizations of regular graphs of high degreeHILTON, A. J. W.Journal of graph theory. 1986, Vol 9, Num 1, pp 193-196, issn 0364-9024Article

Regular graphs of high degree are 1-factorizableCHETWYND, A. G; HILTON, A. J. W.Proceedings of the London Mathematical Society. 1985, Vol 50, Num 2, pp 193-206, issn 0024-6115Article

Some new two-weight codes and strongly regular graphsBROUWER, A. E.Discrete applied mathematics. 1985, Vol 10, Num 1, pp 111-114, issn 0166-218XArticle

On a problem of A. Kotzig concerning factorizations of 4-regular graphsZELINKA, B.Journal of graph theory. 1984, Vol 8, Num 2, pp 325-330, issn 0364-9024Article

On smallest regular graphs with a given isopartFINK, J. F.Journal of graph theory. 1985, Vol 9, Num 1, pp 105-117, issn 0364-9024Article

The uniqueness of the strongly regular graph on 77 pointsBROUWER, A. E.Journal of graph theory. 1983, Vol 7, Num 4, pp 455-461, issn 0364-9024Article

Generating r-regular graphsGUOLI DING; CHEN, Peter.Discrete applied mathematics. 2003, Vol 129, Num 2-3, pp 329-343, issn 0166-218X, 15 p.Article

UNICITE DES GRAPHES FORTEMENT REGULIERS DE 13 ET 17 SOMMETS.HERMANS J.1975; ACAD. R. BELG., BULL. CL. SCI.; BELG.; DA. 1975; VOL. 61; NO 7; PP. 666-674; BIBL. 2 REF.Article

THE NUMBER OF CUT VERTICES IN A REGULAR GRAPH.NIRMALA K; RAMACHANDRA RAO A.1975; CAH. CENTRE ET. RECH. OPERAT.; BELG.; DA. 1975; VOL. 17; NO 2-4; PP. 295-299; BIBL. 4 REF.; (COLLOQ. THEOR. GRAPHES; PARIS; 1974)Conference Paper

STRONGLY REGULAR GRAPHS.HUBAUT XL.1975; DISCRETE MATH.; NETHERL.; DA. 1975; VOL. 13; NO 4; PP. 357-381; BIBL. 3 P. 1/2Article

Universal traversal sequences of length nθ(^LOGn) for cliquesKARLOFF, H. J; RAMAMOHAN PATURI; SIMON, J et al.Information processing letters. 1988, Vol 28, Num 9, pp 241-243, issn 0020-0190Article

A note on the interval number of a graphERDOS, P; WEST, D. B.Discrete mathematics. 1985, Vol 55, Num 2, pp 129-133, issn 0012-365XArticle

Distance-regular graphs with girth 3 or 4:1TERWILLIGER, P.Journal of combinatorial theory. Series B. 1985, Vol 39, Num 3, pp 265-281, issn 0095-8956Article

Partitioning strongly regular graphsNODA, R.Osaka Journal of Mathematics. 1985, Vol 22, Num 2, pp 379-389, issn 0030-6126Article

Regular factors of regular graphsBOLLOBAS, B; SAITO, A; WORMALD, N. C et al.Journal of graph theory. 1985, Vol 9, Num 1, pp 97-103, issn 0364-9024Article

Regular subgraphs of dense graphsPYBER, L.Combinatorica (Print). 1985, Vol 5, Num 4, pp 347-349, issn 0209-9683Article

A distribution invariant for association schemes and strongly regular graphsBIER, T.Linear algebra and its applications. 1984, Vol 57, pp 105-113, issn 0024-3795Article

Cyclability of r-regular r-connected graphsMCCUAIG, W. D; ROSENFELD, M.Bulletin of the Australian Mathematical Society. 1984, Vol 29, Num 1, pp 1-11, issn 0004-9727Article

Interval-regular graphs of diameter twoBANDELT, H.-J; MULDER, H. M.Discrete mathematics. 1984, Vol 50, Num 2-3, pp 117-134, issn 0012-365XArticle

Random walks on regular polyhedra and other distance-regular graphsVAN SLIJPE, A. R. D.Statistica neerlandica. 1984, Vol 38, Num 4, pp 273-292, issn 0039-0402Article

Regular graphs and edge chromatic numberFAUDREE, R. J; SHEEHAN, J.Discrete mathematics. 1984, Vol 48, Num 2-3, pp 197-204, issn 0012-365XArticle

Distance degree regular graphsHILANO, T; NOMURA, K.Journal of combinatorial theory. Series B. 1984, Vol 37, Num 1, pp 96-100, issn 0095-8956Article

Random flights on regular graphsTAKACS, L.Advances in applied probability. 1984, Vol 16, Num 3, pp 618-637, issn 0001-8678Article

Efficient testing of hypergraphs: (Extended abstract)KOHAYAKAWA, Yoshiharu; NAGLE, Brendan; RÖDL, Vojtech et al.Lecture notes in computer science. 2002, pp 1017-1028, issn 0302-9743, isbn 3-540-43864-5, 12 p.Conference Paper

Factors in a class of regular digraphsRAMANATH, M. V. S.Journal of graph theory. 1985, Vol 9, Num 1, pp 161-175, issn 0364-9024Article