A Characterization of Mixed Branching Greedoids

被引：0
|
作者：
Steven J. Tedford
机构：
[1] Franklin and Marshall College,Department of Mathematical Sciences
来源：
Annals of Combinatorics | 2007年 / 11卷
关键词：
05B99; 05C99; greedoid; forbidden minor; rooted mixed graph;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Branching greedoids have been defined and characterized for both directed and undirected rooted graphs. Such greedoids can be extended to rooted mixed graphs – graphs with both directed and undirected edges. These greedoids are characterized by a list of forbidden minors.
引用
收藏
页码：79 / 100
页数：21
相关论文
共 50 条
12345