Critical \((P_5,\mathit{dart})\)-free graphs

DOI10.1007/978-3-031-49614-1_29MaRDI QIDQ6606249

Jorik Jooken, Jan Goedgebeur, Shenwei Huang, Wen Xia

Publication date: 16 September 2024

zbMATH Keywords

graph coloringpolynomial-time algorithms\(k\)-critical graphsstrong perfect graph theorem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• On color-critical (\(P_5\),\(\operatorname{co-}P_5\))-free graphs
• Complexity of coloring graphs without paths and cycles
• Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
• The strong perfect graph theorem
• A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs
• Critical \((P_6, \mathrm{banner})\)-free graphs
• House of graphs 2.0: a database of interesting graphs and more
• Constructions of \(k\)-critical \(P_5\)-free graphs
• Vertex-critical \((P_5\), banner)-free graphs
• Certifying coloring algorithms for graphs without long induced paths
• A Certifying Algorithm for 3-Colorability of P 5-Free Graphs
• Exhaustive generation of k‐critical ‐free graphs
• On $3$-Colorable $P_5$-Free Graphs
• Reducibility among Combinatorial Problems
• \(k\)-critical graphs in \(P_5\)-free graphs
• A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs
• Vertex-critical \((P_5, \mathrm{chair})\)-free graphs
• Critical (\(P_5\), bull)-free graphs
• Some results on \(k\)-critical \(P_5\)-free graphs

This page was built for publication: Critical \((P_5,\mathit{dart})\)-free graphs

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