Tent and a subclass of P₅-free graphs

DOI10.1016/J.ENDM.2016.05.007zbMATH Open1347.05054OpenAlexW2513992336MaRDI QIDQ327628FDOQ327628

Authors: M. A. Shalu, S. Devi Yamini 

Publication date: 19 October 2016

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

Recommendations

• Maximum independent sets in subclasses of \(P_{5}\)-free graphs
• On 3-colorable \(P_5\)-free graphs
• Independent sets in extensions of 2\(K_{2}\)-free graphs
• On maximum independent sets in \(P_{5}\)-free graphs
• Some results on maximum stable sets in certain \(P_{5}\)-free graphs

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Complement reducible graphs
• The ellipsoid method and its consequences in combinatorial optimization
• Unit disk graphs
• Modular decomposition and transitive orientation
• Independent set in \(P_5\)-free graphs in polynomial time
• On maximal independent sets of vertices in claw-free graphs
• Title not available (Why is that?)
• On diameters and radii of bridged graphs
• A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
• Independent Sets in Asteroidal Triple-Free Graphs

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

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