Complete family reduction and spanning connectivity in line graphs

Discrete Mathematics(2023)

引用 0|浏览14
暂无评分
摘要
Complete families of connected graphs, introduced by Catlin in the 1980s, have been known useful in the study of certain graphical properties that are closed under taking contractions. We show that given any complete family C of connected graphs such that C contains graphs with sufficiently many edge-disjoint spanning trees, for any real number a and b with 0更多
查看译文
关键词
Complete family of graphs,Reductions, connectivity,Spanning connectivity,Line graph,Contraction obstacles,Reduction
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要