Tree-core and tree-coritivity of graphs

DOI10.1016/j.ipl.2015.02.016zbMath1329.05068OpenAlexW2037512951MaRDI QIDQ2348704

Jin Xu, Zehui Shao, Chanjuan Liu, Zepeng Li, En-Qiang Zhu

Publication date: 15 June 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.02.016

zbMATH Keywords

combinatorial problemsconnectivityNP-completetree-coretree-coritivity

Mathematics Subject Classification ID

Trees (05C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Toughness and \([a, b\)-factors with inclusion\(/\)exclusion properties]
• Maximum induced trees in graphs
• On a class of posets and the corresponding comparability graphs
• The toughness of a toroidal graph with connectivity 3 and girth 6 is exactly 1
• Tough graphs and Hamiltonian circuits.
• Graph Connectivities, Network Coding, and Expander Graphs
• On unreliability polynomials and graph connectivity in reliable network synthesis
• Finding the Vertex Connectivity of Graphs
• An Algorithm for Determining Whether the Connectivity of a Graph is at Leastk
• Network Flow and Testing Graph Connectivity
• Computing Vertex Connectivity: New Bounds from Old Techniques
• Rupture degree of graphs
• Hamiltonian connectedness in claw-free graphs

This page was built for publication: Tree-core and tree-coritivity of graphs