Vertex-critical (P₅, banner)-free graphs

DOI10.1007/978-3-030-18126-0_10MaRDI QIDQ2327092zbMATH OpenOpenAlexFDO

Authors Qingqiong Cai, Shenwei Huang, Tao Li, Yongtang Shi

Publication date 11 October 2019

Full work available at URL https://doi.org/10.1007/978-3-030-18126-0_10

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Some results on \(k\)-critical \(P_5\)-free graphs
• \(k\)-critical graphs in \(P_5\)-free graphs
• \(k\)-critical graphs in \(P_5\)-free graphs
• Critical \((P_6, \mathrm{banner})\)-free graphs
• Vertex-critical \((P_5, \mathrm{chair})\)-free graphs

Cited in

(13)

• Critical (\(P_5\), bull)-free graphs
• Vertex-critical \((P_5, \mathrm{chair})\)-free graphs
• \(k\)-critical graphs in \(P_5\)-free graphs
• Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four
• Stability in \(P_5\)- and banner-free graphs
• Critical \((P_5,\mathit{dart})\)-free graphs
• Vertex-critical \(( P_3 + \ell P_1 )\)-free and vertex-critical (gem, co-gem)-free graphs
• A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs
• Colouring graphs with no induced six-vertex path or diamond
• Colouring graphs with no induced six-vertex path or diamond
• Some results on \(k\)-critical \(P_5\)-free graphs
• \(k\)-critical graphs in \(P_5\)-free graphs
• Infinite families of \(k\)-vertex-critical \((P_5, C_5)\)-free graphs

This page was built for publication: Vertex-critical \((P_5\), banner)-free graphs

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