Maximum induced matching of hexagonal graphs (Q726519): Difference between revisions

@@ Property / DOI @@
-.1007/s40840-015-0288-9
@@ Property / DOI: 10.1007/s40840-015-0288-9 / rank @@
-Normal rank
@@ 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.1007/s40840-015-0288-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2222374963
@@ Property / OpenAlex ID: W2222374963 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum \(k\)-path vertex cover
@@ Property / cites work: Minimum \(k\)-path vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+Induced matchings
@@ Property / cites work: Induced matchings / rank @@
+Normal rank
@@ Property / cites work @@
+On the induced matching problem
@@ Property / cites work: On the induced matching problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the approximability of the maximum induced matching problem
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Q3139292
@@ Property / cites work: Q3139292 / rank @@
+Normal rank
@@ Property / cites work @@
+Irredundancy in circular arc graphs
@@ Property / cites work: Irredundancy in circular arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+New results on induced matchings
@@ Property / cites work: New results on induced matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation and Online Algorithms
@@ Property / cites work: Approximation and Online Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On the \(k\)-path vertex cover of some graph products
+Normal rank
@@ Property / cites work @@
+The strong chromatic index ofC4-free graphs
@@ Property / cites work: The strong chromatic index ofC4-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum induced matching problem on hhd-free graphs
+Normal rank
@@ Property / cites work @@
+The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
+Normal rank
@@ Property / cites work @@
+Simpler multicoloring of triangle-free hexagonal graphs
+Normal rank
@@ Property / cites work @@
+NP-completeness of some generalizations of the maximum matching problem
+Normal rank
@@ Property / cites work @@
+-local 7/5-competitive algorithm for multicoloring hexagonal graphs
+Normal rank
@@ Property / cites work @@
+Multicoloring of cannonball graphs
@@ Property / cites work: Multicoloring of cannonball graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4944970
@@ Property / cites work: Q4944970 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S40840-015-0288-9
@@ Property / DOI: 10.1007/S40840-015-0288-9 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:726519