Connectivity of the graph induced by contractible edges of a \(k\)-tree

DOI10.1016/J.AMC.2019.01.051zbMath1428.05174OpenAlexW2915580243MaRDI QIDQ2010717

Chengfu Qin, Litao Guo, Lexian Huang

Publication date: 27 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2019.01.051

zbMATH Keywords

edgesconnectivity\(k\)-treeinduced graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Connectivity (05C40)

Cites Work

• On the structure of contractible edges in \(k\)-connected partial \(k\)-trees
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• On the Structure of Contractible Vertex Pairs in Chordal Graphs
• Unnamed Item

This page was built for publication: Connectivity of the graph induced by contractible edges of a \(k\)-tree