Vertex-critical \((P_5\), banner)-free graphs
From MaRDI portal
Publication:2327092
DOI10.1007/978-3-030-18126-0_10OpenAlexW2938209459MaRDI QIDQ2327092
Shenwei Huang, Tao Li, Yongtang Shi, Qingqiong Cai
Publication date: 11 October 2019
Full work available at URL: https://doi.org/10.1007/978-3-030-18126-0_10
Related Items (11)
Colouring graphs with no induced six-vertex path or diamond ⋮ Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four ⋮ A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs ⋮ Vertex-critical \((P_5, \mathrm{chair})\)-free graphs ⋮ Infinite families of \(k\)-vertex-critical \((P_5, C_5)\)-free graphs ⋮ Critical (\(P_5\), bull)-free graphs ⋮ Some results on \(k\)-critical \(P_5\)-free graphs ⋮ Vertex-critical \(( P_3 + \ell P_1 )\)-free and vertex-critical (gem, co-gem)-free graphs ⋮ \(k\)-critical graphs in \(P_5\)-free graphs ⋮ \(k\)-critical graphs in \(P_5\)-free graphs ⋮ Colouring graphs with no induced six-vertex path or diamond
This page was built for publication: Vertex-critical \((P_5\), banner)-free graphs
