Computational aspects of greedy partitioning of graphs
type: Item
instance of: scholarly article
title: Computational aspects of greedy partitioning of graphs
zbMATH Open document ID: 1385.68016
author: Piotr Borowiecki
published in: Journal of Combinatorial Optimization
publication date: 2018-03-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6845587
zbMATH Keywords: graph partitioning
zbMATH Keywords: computational complexity
zbMATH Keywords: graph coloring
zbMATH Keywords: greedy algorithm
zbMATH Keywords: Grundy number
zbMATH Keywords: minimal graphs
describes a project that uses: CriticalPfreeGraphs
MaRDI profile type: Publication
full work available at URL: s10878-017-0185-2
OpenAlex ID: W2767308712
Wikidata QID: Q59610242
cites work: On the Grundy number of graphs with few \(P_4\)'s
cites work: On-line P-coloring of graphs
cites work: On Computational Aspects of Greedy Partitioning of Graphs
cites work: New potential functions for greedy independence and coloring
cites work: Dynamic coloring of graphs
cites work: Graph Classes: A Survey
cites work: The complexity of generalized graph colorings
cites work: First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs
cites work: Some perfect coloring properties of graphs
cites work: Obstructions for three-coloring graphs with one forbidden induced subgraph
cites work: An interpolation theorem for partitions which are complete with respect to hereditary properties
cites work: Some simplified NP-complete graph problems
cites work: Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs
cites work: Q4071280
cites work: On-line 3-chromatic graphs. II: Critical graphs
cites work: Q3496352
cites work: Q4745272
cites work: Constructions of \(k\)-critical \(P_5\)-free graphs
cites work: Q4857375
cites work: First-fit coloring of bounded tolerance graphs
cites work: Q5387684
cites work: On the computational complexity of (O,P)-partition problems
cites work: A note on first-fit coloring of interval graphs
cites work: Q4298260
cites work: New upper bounds for the chromatic number of a graph
cites work: Results on the Grundy chromatic number of graphs
cites work: New bounds for the chromatic number of graphs
DBLP publication ID: journals/jco/Borowiecki18
DOI: 10.1007/S10878-017-0185-2
description: scientific article; zbMATH DE number 6845587