Skip to main content
SpringerLink
Log in

On Partitioning the Edge Set of a Graph into Internally Disjoint Paths without Exterior Vertices

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

A collection of nontrivial paths in a graph G is called a path pile of G, if every edge of G is on exactly one path and no two paths have a common internal vertex. The least number that can be the cardinality of a path pile of G is called the path piling number of G. It can be shown that ε ≤ ν + η where ε, ν and η are respectively the size, the order and the path piling number of G. In this note we characterize structurally the class of all graphs for which the equality of this relation holds.

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

Similar content being viewed by others

References

  1. Acharya B.D., Sampathkumar E.: Graphoidal covers and graphoidal covering number of a graph. Indian J. Pure Appl. Math. 18(10), 882–890 (1987)

    MATH  MathSciNet  Google Scholar 

  2. Arumugam, S., Acharya, B.D., Sampathkumar, E.: Graphoidal covers of a graph: a creative review. In: Arumugam, S., Acharya, B.D., Sampathkumar, E. (eds.) Graph Theory and its Applications. Proceedings of the National Workshop held at Manonmaniam Sundaranar University, Tirunelveli, 1996, pp. 1–28. Tata McGraw-Hill Publishing Company Limited, New Delhi (1997)

  3. Arumugam S., Rajasingh I., Pushpam P.R.L.: On graphs whose acyclic graphoidal covering number is one less than its cyclomatic number. Ars Combin. 72, 255–261 (2004)

    MATH  MathSciNet  Google Scholar 

  4. Arumugam S., Sahul Hamid I.: Simple acyclic graphoidal covers in a graph. Australas. J. Combin. 37, 243–255 (2007)

    MATH  MathSciNet  Google Scholar 

  5. Arumugam S., Sahul Hamid I.: Graphs with unique minimum simple acyclic graphoidal cover. J. Combin. Math. Combin. Comput. 69, 45–52 (2009)

    MATH  MathSciNet  Google Scholar 

  6. Diestel R.: Graph Theory, 2nd edn. Springer, New York (2000)

    Google Scholar 

  7. Gross J.L., Yellen J.: Graph Theory and its Applications, 2nd edn. Chapman & Hall/CRC, New York (2006)

    MATH  Google Scholar 

  8. Pakkiam C., Arumugam S.: The graphoidal covering number of unicyclic graphs. Indian J. Pure Appl. Math. 23(2), 141–143 (1992)

    MATH  MathSciNet  Google Scholar 

  9. Suseela, J.S.: Studies in graph theory. Ph.D. Thesis, Manonmaniam Sundaranar University, Tirunelveli, India (1996)

  10. Vijayakumar G.R.: Partitions of the edge set of a graph into internally disjoint paths. Australas. J. Combin. 39, 241–245 (2007)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics, Tata Institute of Fundamental Research, Homi Bhabha Road, Colaba, Mumbai, 400 005, India

    G. R. Vijayakumar

Authors
  1. G. R. Vijayakumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to G. R. Vijayakumar.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vijayakumar, G.R. On Partitioning the Edge Set of a Graph into Internally Disjoint Paths without Exterior Vertices. Graphs and Combinatorics 27, 143–148 (2011). https://doi.org/10.1007/s00373-010-0963-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-010-0963-4

Keywords

Mathematics Subject Classification (2010)

Search

Navigation