iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://unpaywall.org/10.1007/S00373-008-0809-5
Degree Condition for Subdivisions of Unicyclic Graphs | Graphs and Combinatorics Skip to main content
Springer Nature Link
Log in

Degree Condition for Subdivisions of Unicyclic Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

If H is any graph of order n with k non-trivial components, each of which contains at most one cycle, then every graph of order at least n and minimum degree at least n − k contains a subdivision of H such that only edges contained in a cycle in H are subdivided.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Brandt, S.: Subtrees and Subforests of Graphs. J. Combin Theory Ser. B 61, 63–70 (1994)

    Google Scholar 

  2. Corrádi, K., Hajnal, A.: On the Maximal Number of Independent Circuits in a Graph. Acta Math. Acad. Sci. Hungar. 14, 423–439 (1963)

    Google Scholar 

  3. Enomoto, H.: On the Existence of Disjoint Cycles in a Graph. Combinatorica 18, 487–492 (1998)

    Google Scholar 

  4. Schuster, G.W.: A Minimum Degree Result for Disjoint Cycles and Forests in Graphs. Combinatorica 18, 425–436 (1998)

    Google Scholar 

  5. Bondy, J.A.: Paths and Cycles, Handbook of Combinatorics, Vol. 1, Chapter 1, Ed. R.L. Graham, M. Grotschel and L. Lovász (Elsevier, Amsterdam, 1995)

  6. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. (North Holland, New York, 1976)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology Bombay, Powai, Mumbai, 400076, India

    Ch. Sobhan Babu & Ajit A. Diwan

Authors
  1. Ch. Sobhan Babu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ajit A. Diwan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ch. Sobhan Babu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Babu, C.S., Diwan, A.A. Degree Condition for Subdivisions of Unicyclic Graphs. Graphs and Combinatorics 24, 495–509 (2008). https://doi.org/10.1007/s00373-008-0809-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-008-0809-5

Keywords

Search

Navigation