Computational aspects of greedy partitioning of graphs (Q1702844): Difference between revisions

@@ Property / cites work @@
+On the Grundy number of graphs with few \(P_4\)'s
@@ Property / cites work: On the Grundy number of graphs with few \(P_4\)'s / rank @@
+Normal rank
@@ Property / cites work @@
+On-line P-coloring of graphs
@@ Property / cites work: On-line P-coloring of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Computational Aspects of Greedy Partitioning of Graphs
+Normal rank
@@ Property / cites work @@
+New potential functions for greedy independence and coloring
+Normal rank
@@ Property / cites work @@
+Q2883161
@@ Property / cites work: Q2883161 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of generalized graph colorings
@@ Property / cites work: The complexity of generalized graph colorings / rank @@
+Normal rank
@@ Property / cites work @@
+First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs
+Normal rank
@@ Property / cites work @@
+Some perfect coloring properties of graphs
@@ Property / cites work: Some perfect coloring properties of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Obstructions for three-coloring graphs with one forbidden induced subgraph
+Normal rank
@@ Property / cites work @@
+An interpolation theorem for partitions which are complete with respect to hereditary properties
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs
+Normal rank
@@ Property / cites work @@
+Q4071280
@@ Property / cites work: Q4071280 / rank @@
+Normal rank
@@ Property / cites work @@
+On-line 3-chromatic graphs. II: Critical graphs
@@ Property / cites work: On-line 3-chromatic graphs. II: Critical graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3496352
@@ Property / cites work: Q3496352 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4745272
@@ Property / cites work: Q4745272 / rank @@
+Normal rank
@@ Property / cites work @@
+Constructions of \(k\)-critical \(P_5\)-free graphs
+Normal rank
@@ Property / cites work @@
+Q4857375
@@ Property / cites work: Q4857375 / rank @@
+Normal rank
@@ Property / cites work @@
+First-fit coloring of bounded tolerance graphs
@@ Property / cites work: First-fit coloring of bounded tolerance graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5387684
@@ Property / cites work: Q5387684 / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of (O,P)-partition problems
+Normal rank
@@ Property / cites work @@
+A note on first-fit coloring of interval graphs
@@ Property / cites work: A note on first-fit coloring of interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+New upper bounds for the chromatic number of a graph
+Normal rank
@@ Property / cites work @@
+Results on the Grundy chromatic number of graphs
@@ Property / cites work: Results on the Grundy chromatic number of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+New bounds for the chromatic number of graphs
@@ Property / cites work: New bounds for the chromatic number of graphs / rank @@
+Normal rank