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:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
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: