An upper bound for the competition numbers of graphs (Q968122): 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.dam.2009.09.007
+Normal rank
@@ Property / OpenAlex ID @@
+W1986957580
@@ Property / OpenAlex ID: W1986957580 / rank @@
+Normal rank
@@ Property / cites work @@
+The competition number of a graph having exactly one hole
+Normal rank
@@ Property / cites work @@
+GRAPHS WITH ONE HOLE AND COMPETITION NUMBER ONE
@@ Property / cites work: GRAPHS WITH ONE HOLE AND COMPETITION NUMBER ONE / rank @@
+Normal rank
@@ Property / cites work @@
+Q3114944
@@ Property / cites work: Q3114944 / rank @@
+Normal rank
@@ Property / cites work @@
+The competition number of a graph with exactly \(h\) holes, all of which are independent
+Normal rank
@@ Property / cites work @@
+On the Computation of the Competition Number of a Graph
+Normal rank
@@ Property / cites work @@
+Q4171826
@@ Property / cites work: Q4171826 / rank @@
+Normal rank