Subgraph-avoiding coloring of graphs (Q3553235): 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.1002/jgt.20428
@@ Property / full work available at URL: https://doi.org/10.1002/jgt.20428 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4241642908
@@ Property / OpenAlex ID: W4241642908 / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring the Maximal Cliques of Graphs
@@ Property / cites work: Coloring the Maximal Cliques of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-coloring some classes of odd-hole-free graphs
+Normal rank
@@ Property / cites work @@
+Fibres and ordered set coloring
@@ Property / cites work: Fibres and ordered set coloring / rank @@
+Normal rank
@@ Property / cites work @@
+On the divisibility of graphs
@@ Property / cites work: On the divisibility of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of bicoloring clique hypergraphs of graphs
+Normal rank
@@ Property / cites work @@
+Complexity of clique coloring and related problems
+Normal rank
@@ Property / cites work @@
+The Grötzsch theorem for the hypergraph of maximal cliques
+Normal rank