Pages that link to "Item:Q3747723"
From MaRDI portal
The following pages link to The NP-completeness column: an ongoing guide (Q3747723):
Displayed 50 items.
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- Domination number of the cross product of paths (Q1293195) (← links)
- Forests, colorings and acyclic orientations of the square lattice (Q1306612) (← links)
- The number of nonisomorphic posets having 12 elements (Q1314405) (← links)
- On cocolourings and cochromatic numbers of graphs (Q1315460) (← links)
- A theorem on permutation graphs with applications (Q1328502) (← links)
- On locating cubic subgraphs in bounded-degree connected bipartite graphs (Q1356566) (← links)
- Claw-free graphs---a survey (Q1356695) (← links)
- Dominating sets whose closed stars form spanning trees (Q1357724) (← links)
- Total domination number of grid graphs (Q1613393) (← links)
- Classifying \(k\)-edge colouring for \(H\)-free graphs (Q1739218) (← links)
- The Hamiltonian connectivity of rectangular supergrid graphs (Q1751246) (← links)
- The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
- Transfer flow graphs (Q1801698) (← links)
- Parameterized complexity of vertex colouring (Q1811065) (← links)
- Jump number maximization for proper interval graphs and series-parallel graphs (Q1818782) (← links)
- The Hamiltonian circuit problem for circle graphs is NP-complete (Q1823687) (← links)
- Achromatic number is NP-complete for cographs and interval graphs (Q1825646) (← links)
- Monge matrices make maximization manageable (Q1890948) (← links)
- Characterizing and recognizing the visibility graph of a funnel-shaped polygon (Q1894711) (← links)
- The size of \(k\)-pseudotrees (Q1894770) (← links)
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445) (← links)
- Toughness, hamiltonicity and split graphs (Q1916113) (← links)
- Algorithmic expedients for the prize collecting Steiner tree problem (Q1952504) (← links)
- A fully dynamic graph algorithm for recognizing interval graphs (Q1957648) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- The chromatic index of proper circular-arc graphs of odd maximum degree which are chordal (Q2132339) (← links)
- Building a maximal independent set for the vertex-coloring problem on planar graphs (Q2133444) (← links)
- A heuristic for the coloring of planar graphs (Q2133446) (← links)
- Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage (Q2154102) (← links)
- General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem (Q2177818) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- Edge-colouring graphs with bounded local degree sums (Q2184694) (← links)
- Coloring temporal graphs (Q2237899) (← links)
- Chromatic index of graphs with no cycle with a unique chord (Q2267844) (← links)
- A faster algorithm to recognize undirected path graphs (Q2367409) (← links)
- Complexity separating classes for edge-colouring and total-colouring (Q2391946) (← links)
- The \(k\)-metric dimension (Q2410025) (← links)
- On the complexity of restoring corrupted colorings (Q2424718) (← links)
- Approximating the minimum clique cover and other hard problems in subtree filament graphs (Q2506362) (← links)
- Computing the clique-separator graph for an interval graph in linear time (Q2628270) (← links)
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs (Q2641288) (← links)
- Downstream protection value: detecting critical zones for effective fuel-treatment under wildfire risk (Q2668685) (← links)
- A sequential algorithm for finding a maximum weight<i>K</i>-independent set on interval graphs (Q2710758) (← links)
- On the Structure of Graphs Vertex Critical with Respect to Connected Domination (Q2971614) (← links)
- Approximability of the Path-Distance-Width for AT-free Graphs (Q3104783) (← links)
- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs (Q3605497) (← links)
- On the complexity of graph reconstruction (Q4298372) (← links)
- Maximum weight<i>k</i>-independent set problem on permutation graphs (Q4467342) (← links)
- Independent sets in asteroidal triple-free graphs (Q4572004) (← links)