First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs
From MaRDI portal
Publication:968185
DOI10.1016/j.dam.2009.12.009zbMath1225.05094OpenAlexW1503488242MaRDI QIDQ968185
T. Karthick, Sheshayya A. Choudum
Publication date: 5 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.12.009
Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
On indicated chromatic number of graphs ⋮ Vizing bound for the chromatic number on some graph classes ⋮ Computational aspects of greedy partitioning of graphs ⋮ On Computational Aspects of Greedy Partitioning of Graphs
Cites Work
- Unnamed Item
- Paw-free graphs
- Complement reducible graphs
- Dominating cliques in \(P_ 5\)-free graphs
- Effective on-line coloring of \(P_ 5\)-free graphs
- On-line coloring \(k\)-colorable graphs
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs
- 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
- On (\(P_{5}\), diamond)-free graphs
- Three-colourability and forbidden subgraphs. II: Polynomial algorithms
- Vertex colouring and forbidden subgraphs -- a survey
- On-line graph coloring of \({\mathbb{P}_5}\)-free graphs
- Perfect coloring and linearly χ-boundP6-free graphs
- On-line and first fit colorings of graphs
- On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $
