Pages that link to "Item:Q1838978"

The following pages link to An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs (Q1838978):

Displaying 11 items.

• Hamiltonian numbers of Möbius double loop networks (Q437052) (← links)
• Spanning closed walks and TSP in 3-connected planar graphs (Q462924) (← links)
• Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
• Connected max cut is polynomial for graphs without the excluded minor \(K_5\backslash e\) (Q830923) (← links)
• On the Hamiltonian number of a plane graph (Q1630935) (← links)
• Hamiltonian numbers in oriented graphs (Q1679516) (← links)
• The Hamiltonian numbers in digraphs (Q1956235) (← links)
• Hamiltonian spectra of graphs (Q2000574) (← links)
• The upper traceable number of a graph (Q3624883) (← links)
• The Hamiltonian Number of Cubic Graphs (Q5302756) (← links)
• A Simple 2-Approximation for Maximum-Leaf Spanning Tree (Q6066463) (← links)