On the Mixed Connectivity Conjecture of Beineke and Harary

The conjecture of Beineke and Harary states that for any two vertices which can be separated by $k$ vertices and $l$ edges for $l\geq 1$ but neither by $k$ vertices and $l-1$ edges nor $k-1$ vertices and $l$ edges there are $k+l$ edge-disjoint paths connecting these two vertices of which $k+1$ are i...

Full description

Saved in:
Bibliographic details
Main Author: Johann, Sebastian S
Krumke, Sven O
Streicher, Manuel
Format: Journal Article
Language: English
Place of publication: 30.08.2019
Data of publication: 2019-08-30
Subjects:
Online Access: Fulltext
Database: arXiv Mathematics
arXiv.org
Database information Databases - DBIS