Back to Search
Start Over
Three-regular path pairable graphs
- Source :
- Graphs and Combinatorics. 8:45-52
- Publication Year :
- 1992
- Publisher :
- Springer Science and Business Media LLC, 1992.
-
Abstract
- A graphG with at least 2k vertices isk-path pairable if for anyk pairs of distinct vertices ofG there arek edge disjoint paths between the pairs. It will be shown for any positive integerk that there is ak-path pairable graph of maximum degree three.
Details
- ISSN :
- 14355914 and 09110119
- Volume :
- 8
- Database :
- OpenAIRE
- Journal :
- Graphs and Combinatorics
- Accession number :
- edsair.doi...........59673163a0595ed4a6702f6e3fe8369c
- Full Text :
- https://doi.org/10.1007/bf01271707