Tent and a subclass of P₅-free graphs

DOI10.1016/J.ENDM.2016.05.007MaRDI QIDQ327628zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 6118217 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3445275 (Why is no real title available?)
• A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
• Complement reducible graphs
• Independent Sets in Asteroidal Triple-Free Graphs
• Independent set in \(P_5\)-free graphs in polynomial time
• Modular decomposition and transitive orientation
• On diameters and radii of bridged graphs
• On maximal independent sets of vertices in claw-free graphs
• The ellipsoid method and its consequences in combinatorial optimization
• Unit disk 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)