A short proof of a theorem of Kano and Yu on factors in regular graphs.
Volkmann, Lutz (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “All regular multigraphs of even order and high degree are 1-factorable.”
A short proof of a theorem of Kano and Yu on factors in regular graphs.
Regular spanning subgraphs of bipartite graphs of high minimum degree.
Csaba, Béla (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On regular factors in regular graphs with small radius.
Hoffmann, Arne, Volkmann, Lutz (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On Γ-regular graphs
J. Płonka (1982)
Colloquium Mathematicae
Similarity:
Growth of graph powers.
Pokrovskiy, A. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Linear arboricity of graphs
Mirosław Truszczyński (1986)
Mathematica Slovaca
Similarity:
Large holes in quasi-random graphs.
Polcyn, Joanna (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Edge-coloring of a family of regular graphs.
Mohar, Bojan, Pisanski, Tomaz (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
The linear arboricity of -regular graphs
Filip Guldan (1986)
Mathematica Slovaca
Similarity:
Smallest Regular Graphs of Given Degree and Diameter
Martin Knor (2014)
Discussiones Mathematicae Graph Theory
Similarity:
In this note we present a sharp lower bound on the number of vertices in a regular graph of given degree and diameter.