Skip to main content
SpringerLink
Log in

Smallest regular graphs with girth pair (4, 2t+1)

  • Research Problems
  • Published:
Graphs and Combinatorics 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

References

  1. Andrásfai, B., Erdös, P., Sós, V.T.: On the connection between chromatic number, maximal clique and minimal degree of a graph. Discrete Math.8, 205–208 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  2. Shi, Rong-hua: Smallest regular graphs with girth pair (4, 5). Syst. Sci./Math. Sci.5, 34–42 (1985)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Systems Science, Academia Sinica, Beijing, China

    Tian Feng & Deng Xiao-tie

  2. Mathematics Department, Qinghai Normal University, Xining, China

    Shi Rong-hua

Authors
  1. Tian Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Deng Xiao-tie
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shi Rong-hua
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Feng, T., Xiao-tie, D. & Rong-hua, S. Smallest regular graphs with girth pair (4, 2t+1). Graphs and Combinatorics 1, 201–202 (1985). https://doi.org/10.1007/BF02582945

Download citation

  • Issue Date:

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

Keywords

Search

Navigation