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

DOI10.1016/J.AMC.2019.01.051zbMATH Open1428.05174OpenAlexW2915580243MaRDI QIDQ2010717FDOQ2010717

Authors: 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

Recommendations

• On the structure of contractible edges in \(k\)-connected partial \(k\)-trees
• A local condition for \(k\)-contractible edges
• Contractible Edges in a k-Connected Graph
• Contractible edges in non-separating cycles
• Contractible edges in some \(k\)-connected graphs.

zbMATH Keywords

connectivity\(k\)-treeedgesinduced graph

Mathematics Subject Classification ID

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

Cites Work

• Graph theory with applications
• 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
• On the structure of contractible edges in \(k\)-connected partial \(k\)-trees

Cited In (1)

• On the structure of contractible edges in \(k\)-connected partial \(k\)-trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010717)