Tent and a subclass of \(P_{5}\)-free graphs

DOI10.1016/J.ENDM.2016.05.007zbMath1347.05054OpenAlexW2513992336MaRDI QIDQ327628

S. Devi Yamini, M. A. Shalu

Publication date: 19 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.05.007

zbMATH Keywords

prime graphsmaximum weight independent set\(P_{5}\)-free graphshomogeneous setstent

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On diameters and radii of bridged graphs
• On maximal independent sets of vertices in claw-free graphs
• Complement reducible graphs
• The ellipsoid method and its consequences in combinatorial optimization
• Unit disk graphs
• Modular decomposition and transitive orientation
• Independent Sets in Asteroidal Triple-Free Graphs
• Independent Set in P₅-Free Graphs in Polynomial Time
• A polynomial algorithm to find an independent set of maximum weight in a fork-free graph

This page was built for publication: Tent and a subclass of \(P_{5}\)-free graphs