Graphs with no induced \(C_ 4\) and \(2K_ 2\) (Q1801686): Difference between revisions

@@ Property / author @@
+Zoltán L. Blázsik
@@ Property / author: Zoltán L. Blázsik / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4165164
@@ Property / cites work: Q4165164 / rank @@
+Normal rank
@@ Property / cites work @@
+Covering the cliques of a graph with vertices
@@ Property / cites work: Covering the cliques of a graph with vertices / rank @@
+Normal rank
@@ Property / cites work @@
+Q5749319
@@ Property / cites work: Q5749319 / rank @@
+Normal rank
@@ Property / cites work @@
+On Complementary Graphs
@@ Property / cites work: On Complementary Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Covering all cliques of a graph
@@ Property / cites work: Covering all cliques of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A bound on the chromatic number of graphs without certain induced subgraphs
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0012-365x(93)90477-b
+Normal rank
@@ Property / OpenAlex ID @@
+W179301118
@@ Property / OpenAlex ID: W179301118 / rank @@
+Normal rank