共 50 条
On orienting graphs for connectivity: Projective planes and Halin graphs
被引:0
作者:
Cheriyan, Joseph
[1
]
Zou, Chenglong
[2
]
机构:
[1] Univ Waterloo, Dept Combinator & Optimizat, Waterloo, ON N2L 3G1, Canada
[2] Univ British Columbia, Dept Math, Vancouver, BC, Canada
基金:
加拿大自然科学与工程研究理事会;
关键词:
Graph connectivity;
Graph orientations;
Element connectivity;
Hypergraphs;
Projective planes;
Halin graphs;
ORIENTATIONS;
D O I:
10.1016/j.orl.2012.06.004
中图分类号:
C93 [管理学];
O22 [运筹学];
学科分类号:
070105 ;
12 ;
1201 ;
1202 ;
120202 ;
摘要:
Nash-Williams proved that the edges of a k-edge connected (undirected) graph can be oriented such that the resulting directed graph is left perpendiculark/2right perpendicular-edge connected. A long-standing goal in the area is to obtain analogous results for other types of connectivity, such as node connectivity, element connectivity, and hypergraph edge connectivity. We focus on two special classes of graphs, namely, incidence graphs of projective planes and (generalized) Halin graphs, and we prove some analogs of Nash-Williams' result for these classes. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码:337 / 341
页数:5
相关论文
共 50 条