"On Partitioning the Edge Set of a Graph into Internally Disjoint Paths ..."

Gurusamy Rengasamy Vijayakumar (2011)

> Home

Details and statistics

DOI: 10.1007/S00373-010-0963-4

access: closed

type: Journal Article

metadata version: 2021-08-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/gc/Vijayakumar11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/gc/Vijayakumar11
Gurusamy Rengasamy Vijayakumar:
On Partitioning the Edge Set of a Graph into Internally Disjoint Paths without Exterior Vertices. Graphs Comb. 27(1): 143-148 (2011)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.