Pages that link to "Item:Q1210313"
From MaRDI portal
The following pages link to The edge Hamiltonian path problem is NP-complete for bipartite graphs (Q1210313):
Displaying 13 items.
- UNO is hard, even for a single player (Q389942) (← links)
- Maximizing edge-ratio is NP-complete (Q765326) (← links)
- NP-completeness of some problems of partitioning and covering in graphs (Q794673) (← links)
- Using the Hamiltonian path operator to capture NP (Q1198664) (← links)
- Finding Hamiltonian circuits in arrangements of Jordan curves is NP- complete (Q1341680) (← links)
- HAMILTONian circuits in chordal bipartite graphs (Q1923528) (← links)
- Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks (Q2061347) (← links)
- Algorithms for maximum internal spanning tree problem for some graph classes (Q2091107) (← links)
- On line graphs of subcubic triangle-free graphs (Q2400553) (← links)
- Parameterized edge Hamiltonicity (Q2413968) (← links)
- Algorithms for Page Retrieval and Hamiltonian Paths on Forward-Convex Line Graphs (Q4327827) (← links)
- Intersection graphs of non-crossing paths (Q6041577) (← links)
- Spanning closed trail and hamiltonian cycle in grid graphs (Q6487981) (← links)