Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices

Dalibor Fronček; Petr Kovář; Michael Kubesa

首页> 外文期刊>Graphs and Combinatorics >Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices

【24h】

Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices

机译：完整图分解为最多具有四个非离开顶点的树

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

页面导航

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

摘要

We give a complete characterization of trees with at most four non-leave vertices, which factorize the complete graph K _2n.

机译：我们给出了最多具有四个非离开顶点的树的完整特征，这将完整图K _{2n 分解。}

著录项

来源
《Graphs and Combinatorics》 |2011年第5期|p.621-646|共26页
作者
Dalibor Fronček; Petr Kovář; Michael Kubesa;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类
关键词
入库时间 2022-08-18 01:48:51

相似文献

外文文献
中文文献
专利

1. Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices [J] . Fron?ek D., Ková? P., Kubesa M. Graphs and combinatorics . 2011,第5期

机译：完整图分解为最多具有四个非离开顶点的树
2. Two-factorizations of small complete graphs II: the case of 13 vertices [J] . F. Franek, J. Holub, A. Rosa The Journal of Combinatorial Mathematics and Combinatorial Computing . 2004,第Nov期

机译：小完整图的二次分解II：13个顶点的情况
3. Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations [J] . Mazzuoccolo G., Rinaldi G. Discrete mathematics . 2019,第4期

机译：彩虹跨越树分解在循环1 - accipinations的完整图中
4. Factorizations of Complete Graphs into Spanning Trees with All Possible Maximum Degrees [C] . Petr Kovar, Michael Kubesa Combinatorial algorithms . 2009

机译：将完整图分解为具有所有可能最大程度的生成树
5. Packing trees into complete bipartite graphs. [D] . Hollingsworth, Susan. 2006

机译：将树打包成完整的二部图。
6. An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops [O] . Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi 2020

机译：一种有效的算法用于计算与给定数量的顶点和自循环的树状图
7. Coverings of the complete (di-)graph with n vertices by complete bipartite (di-)graphs with n vertices I [O] . Gronau Hans-Dietrich O.F. 1981

机译：具有n个顶点的完整二分图（di）覆盖I个顶点的完整（di）图I
8. DENDRAL: A system for computer construction, enumeration and notation of organic molecules as tree structures and cyclic graphs. Part 3: Complete chemical graphs; embedding rings in trees [R] . Lederberg, J. 1968

机译：DENDRaL：用于计算机构造，枚举和有机分子符号的系统，如树结构和循环图。第3部分：完整的化学图表;在树中嵌入环

Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices

摘要

著录项

相似文献

相关主题

期刊订阅