Computational aspects of greedy partitioning of graphs
From MaRDI portal
(Redirected from Publication:1702844)
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
Cites work
- scientific article; zbMATH DE number 4170931 (Why is no real title available?)
- scientific article; zbMATH DE number 3487498 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 3800939 (Why is no real title available?)
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- A lower bound for approximating the Grundy number
- A note on first-fit coloring of interval graphs
- An interpolation theorem for partitions which are complete with respect to hereditary properties
- Constructions of k-critical P₅-free graphs
- Dynamic coloring of graphs
- Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs
- First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs
- First-fit coloring of bounded tolerance graphs
- Graph Classes: A Survey
- New bounds for the chromatic number of graphs
- New potential functions for greedy independence and coloring
- New upper bounds for the chromatic number of a graph
- Obstructions for three-coloring graphs with one forbidden induced subgraph
- On Computational Aspects of Greedy Partitioning of Graphs
- On the Grundy number of graphs with few P₄'s
- On the computational complexity of (O,P)-partition problems
- On-line 3-chromatic graphs. II: Critical graphs
- On-line P-coloring of graphs
- Results on the Grundy chromatic number of graphs
- Some perfect coloring properties of graphs
- Some simplified NP-complete graph problems
- The complexity of generalized graph colorings
Cited in
(11)- scientific article; zbMATH DE number 910878 (Why is no real title available?)
- scientific article; zbMATH DE number 1670532 (Why is no real title available?)
- scientific article; zbMATH DE number 4094840 (Why is no real title available?)
- Generalized coloring of permutations
- Generalized Coloring of Permutations
- Dynamic \(F\)-free coloring of graphs
- scientific article; zbMATH DE number 5761786 (Why is no real title available?)
- Graph classes generated by Mycielskians
- scientific article; zbMATH DE number 3983202 (Why is no real title available?)
- On generalized greedy splitting algorithms for multiway partition problems
- Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
This page was built for publication: Computational aspects of greedy partitioning of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1702844)
