A refinement on the structure of vertex-critical (P_5, gem)-free graphs

12/09/2022
by   Ben Cameron, et al.
0

We give a new, stronger proof that there are only finitely many k-vertex-critical (P_5, gem)-free graphs for all k. Our proof further refines the structure of these graphs and allows for the implementation of a simple exhaustive computer search to completely list all 6- and 7-vertex-critical (P_5, gem)-free graphs. Our results imply the existence of polynomial-time certifying algorithms to decide the k-colourability of (P_5, gem)-free graphs for all k where the certificate is either a k-colouring or a (k+1)-vertex-critical induced subgraph. Our complete lists for k≤ 7 allow for the implementation of these algorithms for all k≤ 6.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/30/2020

Dichotomizing k-vertex-critical H-free graphs for H of order four

For k ≥ 3, we prove (i) there is a finite number of k-vertex-critical (P...
research
06/07/2022

Vertex-critical (P_3+ℓ P_1)-free and vertex-critical (gem, co-gem)-free graphs

A graph G is k-vertex-critical if χ(G)=k but χ(G-v)<k for all v∈ V(G) wh...
research
06/06/2023

Infinite families of k-vertex-critical (P_5, C_5)-free graphs

A graph is k-vertex-critical if χ(G)=k but χ(G-v)<k for all v∈ V(G). We ...
research
12/06/2017

On Colouring (2P_2,H)-Free and (P_5,H)-Free Graphs

The Colouring problem asks whether the vertices of a graph can be colour...
research
05/14/2018

Square-free graphs with no six-vertex induced path

We elucidate the structure of (P_6,C_4)-free graphs by showing that ever...
research
10/24/2019

Color-critical Graphs and Hereditary Hypergraphs

A quick proof of Gallai's celebrated theorem on color-critical graphs is...
research
01/06/2021

Minimizers of a free boundary problem on three-dimensional cones

We consider a free boundary problem on three-dimensional cones depending...

Please sign up or login with your details

Forgot password? Click here to reset