First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs
type: Item
instance of: scholarly article
title: First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs
zbMATH Open document ID: 1225.05094
author: T. Karthick
author: S. A. Choudum
published in: Discrete Applied Mathematics
publication date: 2010-05-05T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 5703766
zbMATH Keywords: \(P_{5}\)-free graphs
zbMATH Keywords: paw-free graphs
zbMATH Keywords: on-line coloring
zbMATH Keywords: first-fit coloring
zbMATH Keywords: clique number
MaRDI profile type: Publication
full work available at URL: j.dam.2009.12.009
OpenAlex ID: W1503488242
cites work: On (\(P_{5}\), diamond)-free graphs
cites work: Dominating cliques in \(P_ 5\)-free graphs
cites work: (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
cites work: On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
cites work: An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
cites work: Perfect coloring and linearly χ-boundP6-free graphs
cites work: On-line graph coloring of \({\mathbb{P}_5}\)-free graphs
cites work: Complement reducible graphs
cites work: Q3836509
cites work: On-line and first fit colorings of graphs
cites work: Effective on-line coloring of \(P_ 5\)-free graphs
cites work: On-line coloring \(k\)-colorable graphs
cites work: On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $
cites work: Some results on maximum stable sets in certain \(P_{5}\)-free graphs
cites work: Paw-free graphs
cites work: Vertex colouring and forbidden subgraphs -- a survey
cites work: 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.
cites work: Three-colourability and forbidden subgraphs. II: Polynomial algorithms
DOI: 10.1016/J.DAM.2009.12.009
description: scientific article; zbMATH DE number 5703766