Boundary properties of graphs for algorithmic graph problems (Q551178): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2011.03.001
@@ Property / DOI: 10.1016/j.tcs.2011.03.001 / 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.1016/j.tcs.2011.03.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2085479935
@@ Property / OpenAlex ID: W2085479935 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3362547
@@ Property / cites work: Q3362547 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4369478
@@ Property / cites work: Q4369478 / 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 @@
+Boundary classes of graphs for the dominating set problem
+Normal rank
@@ Property / cites work @@
+NP-hard graph problems and boundary classes of graphs
+Normal rank
@@ Property / cites work @@
+Two New Classes of Hamiltonian Graphs
@@ Property / cites work: Two New Classes of Hamiltonian Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The speed of hereditary properties of graphs
@@ Property / cites work: The speed of hereditary properties of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Distance-hereditary graphs
@@ Property / cites work: Distance-hereditary graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5782525
@@ Property / cites work: Q5782525 / rank @@
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+An interval graph is not a comparability graph
@@ Property / cites work: An interval graph is not a comparability graph / 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 @@
+Hamilton Paths in Grid Graphs
@@ Property / cites work: Hamilton Paths in Grid Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An interval graph is a comparability graph
@@ Property / cites work: An interval graph is a comparability graph / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult
+Normal rank
@@ Property / cites work @@
+Boundary Classes of Planar Graphs
@@ Property / cites work: Boundary Classes of Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Chordal bipartite graphs of bounded tree- and clique-width
+Normal rank
@@ Property / cites work @@
+A new series of dense graphs of high girth
@@ Property / cites work: A new series of dense graphs of high girth / rank @@
+Normal rank
@@ Property / cites work @@
+On the number of boundary classes in the 3-colouring problem
+Normal rank
@@ Property / cites work @@
+Q3115195
@@ Property / cites work: Q3115195 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3115202
@@ Property / cites work: Q3115202 / rank @@
+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 @@
+Proper minor-closed families are small
@@ Property / cites work: Proper minor-closed families are small / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two
+Normal rank
@@ Property / cites work @@
+Graph minors. V. Excluding a planar graph
@@ Property / cites work: Graph minors. V. Excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+On the size of hereditary classes of graphs
@@ Property / cites work: On the size of hereditary classes of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Nonredundant 1’s in $\Gamma $-Free Matrices
@@ Property / cites work: Nonredundant 1’s in $\Gamma $-Free Matrices / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2011.03.001
@@ Property / DOI: 10.1016/J.TCS.2011.03.001 / rank @@
+Normal rank