2-Extendability in Two Classes of Claw-Free Graphs

机译：两类无爪图的2-可扩展性

获取原文

页面导航

摘要
著录项
相似文献
相关主题

摘要

A graph G is 2-extendable if it has at least six vertices and every pair ofindependent edges extends to (i.e., is a subset of) a perfect matching. In this

著录项

作者
Plummer, M. D.;
展开▼
作者单位

展开▼
年度 1992
页码
总页数 20
原文格式 PDF
正文语种 eng
中图分类工业技术;
关键词
Edges; Matching; Theory;

机译：边;匹配;理论;

相似文献

外文文献
中文文献
专利

1. Some classical combinatorial problems on circulant and claw-free graphs: the isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs [J] . Ugo Pietropaoli 4OR . 2009,第3期

机译：循环图和无爪图上的一些经典组合问题：循环图上的同构和着色问题以及无爪图上的稳定集问题
2. Some classical combinatorial problems on circulant and claw-free graphs: the isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs [J] . Ugo Pietropaoli 4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies . 2009,第3期

机译：循环图和无爪图上的一些经典组合问题：循环图上的同构和着色问题以及无爪图上的稳定集问题
3. The 2-extendability of 5-connected graphs on surfaces with large representativity [J] . Kawarabayashi K, Negami S, Plummer MD, Journal of Combinatorial Theory, Series B . 2011,第4期

机译：具有大代表性的曲面上的5个连通图的2个可扩展性
4. Better Approximation Algorithms for Maximum Weight Internal Spanning Trees in Cubic Graphs and Claw-Free Graphs [C] . Ahmad Biniaz International Conference and Workshops on Algorithms and Computation . 2021

机译：更好的近似算法，用于在立方图中的最大重量内部跨越树木和无爪图形
5. Claw-free graphs and line graphs. [D] . Shao, Yehong. 2005

机译：无爪图和折线图。
6. On the characterization of claw-free graphs with given total restrained domination number [O] . Xiaoming Pi -1

机译：给定总约束支配数的无爪图的刻画
7. The 2-extendability of 5-connected graphs on surfaces with large representativity [O] . Kawarabayashi Ken-ichi, Negami Seiya, Plummer Michael D., 2011

机译：具有大代表性的曲面上的5个连通图的2个可扩展性

2-Extendability in Two Classes of Claw-Free Graphs

摘要

著录项

相似文献

相关主题

期刊订阅