A method of graph reduction and its applications (Q1669583): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1515/dma-2018-0022
+Normal rank
@@ Property / OpenAlex ID @@
+W2888414688
@@ Property / OpenAlex ID: W2888414688 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3893327
@@ Property / cites work: Q3893327 / rank @@
+Normal rank
@@ Property / cites work @@
+Local transformations of graphs preserving independence number
+Normal rank
@@ Property / cites work @@
+Q3115672
@@ Property / cites work: Q3115672 / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Planarity Testing
@@ Property / cites work: Efficient Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+On the Maximum Independent Set Problem in Subclasses of Planar Graphs
+Normal rank
@@ Property / cites work @@
+On the maximum independent set problem in subclasses of subcubic graphs
+Normal rank
@@ Property / cites work @@
+Classes of subcubic planar graphs for which the independent set problem is polynomially solvable
+Normal rank
@@ Property / Wikidata QID @@
+Q129354095
@@ Property / Wikidata QID: Q129354095 / rank @@
+Normal rank