NP-hard graph problems and boundary classes of graphs (Q2465640): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2007.09.013
+Normal rank
@@ Property / OpenAlex ID @@
+W2081207138
@@ Property / OpenAlex ID: W2081207138 / rank @@
+Normal rank
@@ Property / cites work @@
+On easy and hard hereditary classes of graphs with respect to the independent set problem
+Normal rank
@@ Property / cites work @@
+Q4272117
@@ Property / cites work: Q4272117 / rank @@
+Normal rank
@@ Property / cites work @@
+Boundary classes of graphs for the dominating set problem
+Normal rank
@@ Property / cites work @@
+Some APX-completeness results for cubic graphs
@@ Property / cites work: Some APX-completeness results for cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Distance-hereditary graphs
@@ Property / cites work: Distance-hereditary graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of derived graphs
@@ Property / cites work: Characterizations of derived graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4425939
@@ Property / cites work: Q4425939 / rank @@
+Normal rank
@@ Property / cites work @@
+Independent domination in finitely defined classes of graphs
+Normal rank
@@ Property / cites work @@
+Q5463498
@@ Property / cites work: Q5463498 / rank @@
+Normal rank
@@ Property / cites work @@
+Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Domination in convex and chordal bipartite graphs
@@ Property / cites work: Domination in convex and chordal bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Independent domination in chordal graphs
@@ Property / cites work: Independent domination in chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Betweenness, orders and interval graphs
@@ Property / cites work: Betweenness, orders and interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4193514
@@ Property / cites work: Q4193514 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
@@ Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic graph theory and perfect graphs
@@ Property / cites work: Algorithmic graph theory and perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Totally-Balanced and Greedy Matrices
@@ Property / cites work: Totally-Balanced and Greedy Matrices / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Hamilton Paths in Grid Graphs
@@ Property / cites work: Hamilton Paths in Grid Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Recent developments on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size
+Normal rank
@@ Property / cites work @@
+The 3-Colorability Problem on Graphs with Maximum Degree Four
+Normal rank
@@ Property / cites work @@
+Q3353058
@@ Property / cites work: Q3353058 / rank @@
+Normal rank
@@ Property / cites work @@
+On the jump number problem in hereditary classes of bipartite graphs
+Normal rank
@@ Property / cites work @@
+On maximum induced matchings in bipartite graphs
@@ Property / cites work: On maximum induced matchings in bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
+Normal rank
@@ Property / cites work @@
+Chordal bipartite graphs of bounded tree- and clique-width
+Normal rank
@@ Property / cites work @@
+On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
+Normal rank
@@ Property / cites work @@
+Threshold graphs and related topics
@@ Property / cites work: Threshold graphs and related topics / rank @@
+Normal rank
@@ Property / cites work @@
+Alternating cycle-free matchings
@@ Property / cites work: Alternating cycle-free matchings / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
+Normal rank
@@ Property / cites work @@
+HAMILTONian circuits in chordal bipartite graphs
@@ Property / cites work: HAMILTONian circuits in chordal bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Computing independent sets in graphs with large girth
+Normal rank
@@ Property / cites work @@
+Three-colourability and forbidden subgraphs. II: Polynomial algorithms
+Normal rank
@@ Property / cites work @@
+-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.
+Normal rank
@@ Property / cites work @@
+Q4004146
@@ Property / cites work: Q4004146 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge Dominating Sets in Graphs
@@ Property / cites work: Edge Dominating Sets in Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the Minimum Fill-In is NP-Complete
@@ Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+Satgraphs and independent domination. I
@@ Property / cites work: Satgraphs and independent domination. I / rank @@
+Normal rank