Connected greedy colouring in claw-free graphs

05/04/2018
by   Ngoc Khang Le, et al.
0

An ordering of the vertices of a graph is connected if every vertex (but the first) has a neighbor among its predecessors. The greedy colouring algorithm of a graph with a connected order consists in taking the vertices in order, and assigning to each vertex the smallest available colour. A graph is good if the greedy algorithm on every connected order gives every connected induced subgraph of it an optimal colouring. We give the characterization of good claw-free graphs in terms of minimal forbidden induced subgraphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/26/2021

Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly

The Grundy number of a graph is the maximum number of colours used by th...
research
01/30/2023

Cops and robbers on P_5-free graphs

We prove that every connected P_5-free graph has cop number at most two,...
research
07/24/2018

Connected greedy coloring H-free graphs

A connected ordering (v_1, v_2, ..., v_n) of V(G) is an ordering of the ...
research
01/17/2022

A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem

We propose a new and strengthened Branch-and-Bound (BnB) algorithm for t...
research
04/16/2021

On the power of random greedy algorithms

In this paper we solve two problems of Esperet, Kang and Thomasse as wel...
research
01/06/2022

BFS based distributed algorithm for parallel local directed sub-graph enumeration

Estimating the frequency of sub-graphs is of importance for many tasks, ...
research
08/03/2023

Greedy Matroid Algorithm And Computational Persistent Homology

An important problem in computational topology is to calculate the homol...

Please sign up or login with your details

Forgot password? Click here to reset