New posts in hamiltonian-path

Maximum number of edges in a non-Hamiltonian graph

graph-theory hamiltonian-path

Zelda - Oracle of Ages tiles rooms puzzles: how can you prove if there are/aren't solutions?

graph-theory puzzle hamiltonian-path

Graph Theory: How do we know Hamiltonian Path exists in graph where every vertex has degree ≥3?

graph-theory hamiltonian-path

Is this graph Hamiltonian?

discrete-mathematics graph-theory hamiltonian-path

Is there a graph with all vertices having degree 3 or greater that doesn't have a hamiltonian path?

discrete-mathematics graph-theory hamiltonian-path

Graph with even vertices and ${n-1}\choose 2$ $+ 1$ edges has a perfect matching

combinatorics discrete-mathematics graph-theory hamiltonian-path matching-theory

Can a bipartite graph have many Hamiltonian paths but no Hamiltonian cycle?

graph-theory hamiltonian-path bipartite-graphs

Connected graph with colored edges

graph-theory coloring hamiltonian-path eulerian-path

Proof of Hamilton Cycle in a Complete Bipartite Graph

graph-theory hamiltonian-path

Who has a winning strategy in the hamilton-circle-game?

graph-theory game-theory combinatorial-game-theory hamiltonian-path

Difference between hamiltonian path and euler path

algorithm graph graph-theory hamiltonian-path euler-path

Every bipartite Eulerian graph is a Hamilton graph

graph-theory bipartite-graphs hamiltonian-path eulerian-path

Determine the number of Hamiltonian cycles in K2,3 and K4,4 and the existence of Euler trails

graph-theory hamiltonian-path

Covering pairs with permutations

combinatorics graph-theory permutations hamiltonian-path latin-square

Number of edge disjoint Hamiltonian cycles in a complete graph with even number of vertices.

graph-theory hamiltonian-path

If $deg(u)+deg(v) \ge n-1$ for $u$ and $v$ are non adjacent vertices, then G has Hamiltonian path

graph-theory hamiltonian-path

Suppose E is a set of non adjacent edges of G and $\delta(G)\ge\frac{n+e}{2}$.Show that there is a Hamiltonian cycle that contains all the edges of E.

graph-theory hamiltonian-path

A $3 \times 3 \times 3$ cube has no Hamiltonian path starting at the corner.

graph-theory hamiltonian-path

How many knight's tours are there?

combinatorics graph-theory hamiltonian-path knight-tours

Prove that every tournament contains at least one Hamiltonian path.

graph-theory hamiltonian-path