论文信息 - Embedding k-Regular Graphs in k + 1-Regular Graphs

Embedding k-Regular Graphs in k + 1-Regular Graphs

Etant donne un graphe k-regulier d'ordre n, on etudie le nombre minimum v(G) de sommets extra necessaires pour plonger G dans un graphe (k+1)-regulier

A. Gardiner

[1] B. Bollobás,et al. Maximal matchings in graphs with given minimal and maximal degrees , 1976 .

[2] Bill Jackson. Hamilton cycles in regular 2-connected graphs , 1980, J. Comb. Theory, Ser. B.