Dynamic \(F\)-free coloring of graphs
type: Item
instance of: scholarly article
title: Dynamic \(F\)-free coloring of graphs
zbMATH Open document ID: 1397.05059
author: Piotr Borowiecki
author: Elżbieta Sidorowicz
published in: Graphs and Combinatorics
publication date: 2018-06-07T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 6882042
zbMATH Keywords: graph coloring
zbMATH Keywords: subcoloring
zbMATH Keywords: improper coloring
zbMATH Keywords: greedy algorithm
zbMATH Keywords: Grundy number
describes a project that uses: CriticalPfreeGraphs
MaRDI profile type: Publication
full work available at URL: s00373-018-1886-8
OpenAlex ID: W2793449571
Wikidata QID: Q62043599
cites work: The complexity of \(G\)-free colourability
cites work: The subchromatic number of a graph
cites work: On the Grundy number of graphs with few \(P_4\)'s
cites work: IMPROPER COLORING OF WEIGHTED GRID AND HEXAGONAL GRAPHS
cites work: New potential functions for greedy independence and coloring
cites work: Computational aspects of greedy partitioning of graphs
cites work: Dynamic coloring of graphs
cites work: Q3689206
cites work: Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult
cites work: Iterative coloring extension of a maximum clique
cites work: Q5560916
cites work: Q3525736
cites work: Some perfect coloring properties of graphs
cites work: Obstructions for three-coloring graphs with one forbidden induced subgraph
cites work: Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
cites work: Graph Subcolorings: Complexity and Algorithms
cites work: Subcolorings and the subchromatic number of a graph
cites work: Partitions of graphs into cographs
cites work: Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs
cites work: Improper coloring of unit disk graphs
cites work: Q4745272
cites work: \(P_4\)-colorings and \(P_4\)-bipartite graphs
cites work: Constructions of \(k\)-critical \(P_5\)-free graphs
cites work: Q4857375
cites work: Graph colouring and the probabilistic method
cites work: Networks
cites work: Results on the Grundy chromatic number of graphs
DOI: 10.1007/S00373-018-1886-8
description: scientific article; zbMATH DE number 6882042