Sequential NP₅, IP₅, MP₅ graphs

zbMATH Open1265.05587MaRDI QIDQ3145339FDOQ3145339

Authors: Mihai Talmaciu 

Publication date: 19 December 2012

Recommendations

• scientific article; zbMATH DE number 2227376
• On a Class of P ₅ -Free Graphs
• On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
• On 3-colorable \(P_5\)-free graphs
• Perfect graphs with no \(P_ 5\) and no \(K_ 5\)

zbMATH Keywords

perfect graphstriangulated graphweakly triangulated graphslightly triangulated graph\(NP_5, IP_5, MP_5\) graphquasi-triangulated graph

Mathematics Subject Classification ID

Graph theory (05C99)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Sequential \(NP_5, IP_5, MP_5\) graphs

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