The competition number of a graph with exactly two holes (Q434196): Difference between revisions

@@ Property / DOI @@
-.1007/s10878-010-9331-9
@@ Property / DOI: 10.1007/s10878-010-9331-9 / rank @@
-Normal rank
@@ Property / author @@
-Gerard Jennhwa Chang
@@ Property / author: Gerard Jennhwa Chang / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2139042312
@@ Property / OpenAlex ID: W2139042312 / rank @@
+Normal rank
@@ Property / cites work @@
+The competition number of a graph having exactly one hole
+Normal rank
@@ Property / cites work @@
+On rigid circuit graphs
@@ Property / cites work: On rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5752597
@@ Property / cites work: Q5752597 / rank @@
+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 @@
+Competition numbers of graphs with a small number of triangles
+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 / DOI @@
+.1007/S10878-010-9331-9
@@ Property / DOI: 10.1007/S10878-010-9331-9 / rank @@
+Normal rank