Work

Coloring ($P_5$, bull)-free graphs

Year: 2017

Type: preprint

Abstract: We give a polynomial-time algorithm that computes the chromatic number of any graph that contains no path on five vertices and no bull as an induced subgraph (where the bull is the graph with five vertices $a,b,c,d,e$ and edges $ab,bc,cd,be,ce$).

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1707.08918

Author: Maffray, Frédéric

Institutions: Centre National de la Recherche Scientifique, Laboratoire des Sciences pour la Conception, l'Optimisation et la Production, Université Grenoble Alpes

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4291556928

Cites:

Cited by:

Related to: 10