Skip to main content
SpringerLink
Log in

Minimal Hamiltonian graphs with prescribed degree sets

  • Published:
Mathematical notes of the Academy of Sciences of the USSR Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature cited

  1. L. Lesniak, A. D. Polimeni, and D. W. Vanderjagt, “Degree sets and traversability,” Rend. Mat.,10, No. 2–3, 193–204 (1977).

    Google Scholar 

  2. I. E. Zverovich, “Realizability of a finite set of natural numbers as the set of degrees of vertices of a Hamiltonian graph,” Izv. Akad. Nauk BSSR, Ser. Fiz.-Mat., No. 4, 32–37 (1986).

    Google Scholar 

  3. I. E. Zverovich, “Degree set and traversability of a graph,” (Redkollegiya Zh. Izv. Akad. Nauk BSSR, Ser. Fiz.-Mat., 1986). Manuscript deposited at VINITI.

  4. S. F. Kapoor, A. D. Polimeni, and C. E. Wall, “Degree sets for graphs,” Fund. Math.,95, No. 3, 189–194 (1977).

    Google Scholar 

  5. R. J. Gould and D. R. Lick, “Degree sets and graph factorizations,” Colloq. Math.,48, No. 2, 269–277 (1984).

    Google Scholar 

  6. P. L. Hammer, T. Ibaraki, and B. Simeone, “Threshold sequences,” SIAM J. Algebraic Discrete Methods,2, No. 1, 39–49 (1981).

    Google Scholar 

  7. E. Ruch and I. Gutman, “The branching extent of graphs,” J. Combin. Inform. System Sci.,4, No. 4, 285–295 (1979).

    Google Scholar 

  8. D. J. Kleitman and D. L. Wang, “Algorithms for constructing graphs and digraphs with given valences and factors,” Discrete Math.,6, 79–88 (1973).

    Google Scholar 

  9. S. Kundu, “The k-factor conjecture is true,” Discrete Math.,6, 367–376 (1973).

    Google Scholar 

  10. A. R. Rao and S. B. Rao, “On factorable degree sequences,” J. Combinatorial Theory,B13, 185–191 (1972).

    Google Scholar 

  11. T. A. Sipka, “The orders of graphs with prescribed degree sets,” J. Graph Theory,4, No. 3, 301–307 (1980).

    Google Scholar 

  12. E. F. Schmeichel and S. L. Hakimi, “On the existence of a traceable graph with prescribed vertex degrees,” Ars. Combinatorica,4, 69–80 (1977).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Machine Reliability Problems, Academy of Sciences of the Belorussian SSR, USSR

    A. A. Chernyak

Authors
  1. A. A. Chernyak
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Matematicheskie Zametki, Vol. 47, No. 4, pp. 115–127, April, 1990.

The author expresses his gratitude to the referee for suggesting several important complements to the initial version of the paper.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chernyak, A.A. Minimal Hamiltonian graphs with prescribed degree sets. Mathematical Notes of the Academy of Sciences of the USSR 47, 391–400 (1990). https://doi.org/10.1007/BF01163824

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01163824

Keywords

Search

Navigation