A survey of graph coloring - its types, methods and applications (Q2978431): Difference between revisions

@@ Property / OpenAlex ID @@
+W2076967887
@@ Property / OpenAlex ID: W2076967887 / rank @@
+Normal rank
@@ Property / cites work @@
+Acyclic coloring of graphs
@@ Property / cites work: Acyclic coloring of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Acyclic edge colorings of graphs
@@ Property / cites work: Acyclic edge colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic aspects of acyclic edge colorings
@@ Property / cites work: Algorithmic aspects of acyclic edge colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable
@@ Property / cites work: Every planar map is four colorable / rank @@
+Normal rank
@@ Property / cites work @@
+Precoloring extension. I: Interval graphs
@@ Property / cites work: Precoloring extension. I: Interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+New methods to color the vertices of a graph
@@ Property / cites work: New methods to color the vertices of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4180377
@@ Property / cites work: Q4180377 / rank @@
+Normal rank
@@ Property / cites work @@
+Acyclic edge-colouring of planar graphs. Extended abstract
+Normal rank
@@ Property / cites work @@
+Fulkerson's conjecture and circuit covers
@@ Property / cites work: Fulkerson's conjecture and circuit covers / rank @@
+Normal rank
@@ Property / cites work @@
+Star coloring of graphs
@@ Property / cites work: Star coloring of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Fan–Raspaud conjecture: A randomized algorithmic approach and application to the pair assignment problem in cubic networks
+Normal rank
@@ Property / cites work @@
+Blocking and anti-blocking pairs of polyhedra
@@ Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank @@
+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 @@
+Q4418398
@@ Property / cites work: Q4418398 / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Q4857375
@@ Property / cites work: Q4857375 / rank @@
+Normal rank
@@ Property / cites work @@
+pretty graph colouring problems
@@ Property / cites work: 25 pretty graph colouring problems / rank @@
+Normal rank
@@ Property / cites work @@
+Acyclic and star colorings of cographs
@@ Property / cites work: Acyclic and star colorings of cographs / rank @@
+Normal rank
@@ Property / cites work @@
+Equitable Coloring
@@ Property / cites work: Equitable Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Q3173765
@@ Property / cites work: Q3173765 / rank @@
+Normal rank
@@ Property / cites work @@
+A bound on the total chromatic number
@@ Property / cites work: A bound on the total chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+Tree search algorithms for the dominating vertex set problem
+Normal rank
@@ Property / cites work @@
+Acyclic colorings of subcubic graphs
@@ Property / cites work: Acyclic colorings of subcubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Star chromatic number
@@ Property / cites work: Star chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+Circular chromatic number: A survey
@@ Property / cites work: Circular chromatic number: A survey / rank @@
+Normal rank