Pages that link to "Item:Q650325"

The following pages link to On the complexity of some problems related to graph extensions (Q650325):

Displaying 22 items.

• T-irreducible extension of polygonal digraphs (Q283070) (← links)
• On the \({\mathcal {H}}\)-free extension complexity of the TSP (Q519756) (← links)
• An extension of a fixed point problem for simple graphs (Q686510) (← links)
• The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems (Q1185244) (← links)
• Extension complexity of stable set polytopes of bipartite graphs (Q1687905) (← links)
• The matching extension problem in general graphs is co-NP-complete (Q1743490) (← links)
• On the complexity of computing the excessive \([B]\)-index of a graph (Q2811195) (← links)
• (Q3054050) (← links)
• (Q3340147) (← links)
• Vertex extensions of 4-layer graphs and hypercubes (Q5059988) (← links)
• Construction of All Minimal Edge Extensions of the Graph with Isomorphism Rejection (Q5122697) (← links)
• (Q5150437) (← links)
• (Q5150517) (← links)
• (Q5150590) (← links)
• (Q5150601) (← links)
• UPPER BOUND FOR THE NUMBER OF ADDITIONAL EDGES IN MINIMAL 1-EDGE EXTENSIONS OF STARLIKE TREES (Q5150715) (← links)
• T-IRREDUCIBLE EXTENSIONS OF DIRECTED STARLIKE TREES (Q5150758) (← links)
• ON MINIMAL VERTEX 1-EXTENSIONS OF PATH ORIENTATION (Q5151083) (← links)
• Construction of All Nonisomorphic Minimal Vertex Extensions of the Graph by the Method of Canonical Representatives (Q5218295) (← links)
• Algorithms for #BIS-hard problems on expander graphs (Q5236322) (← links)
• About uniqueness of the minimal 1-edge extension of hypercube Q4 (Q5871441) (← links)
• Recognizing \(k\)-clique extendible orderings (Q5925536) (← links)