\([r,s,t]\)-coloring of trees and bipartite graphs (Q960923): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2008.09.021
+Normal rank
@@ Property / OpenAlex ID @@
+W1971073571
@@ Property / OpenAlex ID: W1971073571 / rank @@
+Normal rank
@@ Property / cites work @@
+\((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
+Normal rank
@@ Property / cites work @@
+Q5782525
@@ Property / cites work: Q5782525 / rank @@
+Normal rank
@@ Property / cites work @@
+Relations between the lower domination parameters and the chromatic number of a graph.
+Normal rank
@@ Property / cites work @@
+Integral distance graphs
@@ Property / cites work: Integral distance graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An improved algorithm for approximating the chromatic number of \(G_{n,p}\)
+Normal rank
@@ Property / cites work @@
+Using stable sets to bound the chromatic number
@@ Property / cites work: Using stable sets to bound the chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+On planarity and colorability of circulant graphs
@@ Property / cites work: On planarity and colorability of circulant graphs / 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 @@
+Q5443246
@@ Property / cites work: Q5443246 / rank @@
+Normal rank
@@ Property / cites work @@
+\([r,s,t]\)-colorings of graphs
@@ Property / cites work: \([r,s,t]\)-colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+\([r,s,t]\)-chromatic numbers and hereditary properties of graphs
+Normal rank
@@ Property / cites work @@
+Total colouring regular bipartite graphs is NP-hard
+Normal rank
@@ Property / cites work @@
+A bound on the chromatic number of the square of a planar graph
+Normal rank
@@ Property / cites work @@
+On the chromatic number and independence number of hypergraph products
+Normal rank
@@ Property / cites work @@
+Q4242948
@@ Property / cites work: Q4242948 / rank @@
+Normal rank
@@ Property / cites work @@
+Determining the total colouring number is NP-hard
@@ Property / cites work: Determining the total colouring number is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs of maximum degree seven are Class I
@@ Property / cites work: Planar graphs of maximum degree seven are Class I / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bounds for the chromatic number of a graph
@@ Property / cites work: Upper bounds for the chromatic number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q3515428
@@ Property / cites work: Q3515428 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3598057
@@ Property / cites work: Q3598057 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5558480
@@ Property / cites work: Q5558480 / rank @@
+Normal rank
@@ Property / cites work @@
+Every planar graph with maximum degree 7 is of class 1
+Normal rank