On factors with all degrees odd

@article{Amahashi1985OnFW,
  title={On factors with all degrees odd},
  author={Atsushi Amahashi},
  journal={Graphs and Combinatorics},
  year={1985},
  volume={1},
  pages={111-114}
}
A {1, 3 . . . . . 2n 1}-factor of a graph G is defined to be a spanning subgraph of G each degree of whose vertices is one of { 1, 3 . . . . . 2n 1 }, where n is a positive integer. In this paper, we give criterions for the existence of a {1, 3 . . . . . 2n 1}-factor in a tr.ee and in a graph. 

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Graph Theory. Graduate Texts in Mathematics 63

B. Bollobs
New York: Springer • 1979

Perfect matching in a graph

I. Anderson
J. Comb. Theory (B) 10, 183-186 • 1971
View 1 Excerpt

Die Theorie der regul~iren graphs

J. Petersen
Acta Math. 15, 193-220 • 1891
View 2 Excerpts

Similar Papers

Loading similar papers…