Pages that link to "Item:Q1199472"

The following pages link to NP-completeness and degree restricted spanning trees (Q1199472):

Displaying 23 items.

• The VC-dimension of graphs with respect to \(k\)-connected subgraphs (Q335348) (← links)
• Bounded degree spanning trees (extended abstract) (Q826078) (← links)
• Decomposing plane cubic graphs (Q896062) (← links)
• Complexities of some interesting problems on spanning trees (Q1041729) (← links)
• Variations of the maximum leaf spanning tree problem for bipartite graphs (Q1045917) (← links)
• NP-completeness of minimum spanner problems (Q1315465) (← links)
• Finding compact scheme forests in nested normal form is NP-hard (Q1322463) (← links)
• Spanning star trees in regular graphs (Q1376073) (← links)
• The \(k\)-leaf spanning tree problem admits a klam value of 39 (Q1678098) (← links)
• Decomposing graphs into a spanning tree, an even graph, and a star forest (Q1732026) (← links)
• Complexity of the directed spanning cactus problem (Q1765377) (← links)
• The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs (Q1893154) (← links)
• Decompositions of cubic traceable graphs (Q2282463) (← links)
• Complexity of independency and cliquy trees (Q2283099) (← links)
• Homeomorphically irreducible spanning trees in hexangulations of surfaces (Q2317663) (← links)
• Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
• Linear kernels for outbranching problems in sparse digraphs (Q2408200) (← links)
• On dominating sets whose induced subgraphs have a bounded diameter (Q2444556) (← links)
• Fixed-Parameter Tractability for Non-Crossing Spanning Trees (Q3603545) (← links)
• (Q4851642) (← links)
• Complexity of spanning tree problems with leaf-dependent objectives (Q4887748) (← links)
• A win-win algorithm for the $(k+1)$-LST/$k$-pathwidth problem (Q5100142) (← links)
• On the structure of a smallest counterexample and a new class verifying the 2-decomposition conjecture (Q6632140) (← links)