Pages that link to "Item:Q4302282"

The following pages link to Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs (Q4302282):

Displaying 39 items.

• Hamiltonian properties of locally connected graphs with bounded vertex degree (Q643015) (← links)
• Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs (Q685527) (← links)
• An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
• Cyclability in graph classes (Q833007) (← links)
• On the intersection of tolerance and cocomparability graphs (Q896656) (← links)
• Finding Hamiltonian circuits in quasi-adjoint graphs (Q955323) (← links)
• Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm (Q1198484) (← links)
• Partial and perfect path covers of cographs (Q1281391) (← links)
• Hamiltonian powers in threshold and arborescent comparability graphs (Q1301703) (← links)
• 1-tough cocomparability graphs are hamiltonian (Q1363656) (← links)
• Weighted domination of cocomparability graphs (Q1382270) (← links)
• Jump number maximization for proper interval graphs and series-parallel graphs (Q1818782) (← links)
• Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs (Q1827836) (← links)
• Toughness, hamiltonicity and split graphs (Q1916113) (← links)
• HAMILTONian circuits in chordal bipartite graphs (Q1923528) (← links)
• The longest path problem is polynomial on cocomparability graphs (Q1939666) (← links)
• Revising Johnson's table for the 21st century (Q2091799) (← links)
• Happy set problem on subclasses of co-comparability graphs (Q2154092) (← links)
• Vertex deletion into bipartite permutation graphs (Q2161007) (← links)
• Mim-width. I. Induced path problems (Q2174563) (← links)
• Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
• Computing and counting longest paths on circular-arc graphs in polynomial time (Q2448873) (← links)
• Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
• Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561) (← links)
• Complete edge-colored permutation graphs (Q2672966) (← links)
• Succinct permutation graphs (Q2684486) (← links)
• New geometric representations and domination problems on tolerance and multitolerance graphs (Q2820855) (← links)
• The Longest Path Problem is Polynomial on Cocomparability Graphs (Q3057610) (← links)
• (Q3115591) (← links)
• A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs (Q4242916) (← links)
• A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265) (← links)
• Independent sets in asteroidal triple-free graphs (Q4572004) (← links)
• (Q4691817) (← links)
• AN ALGORITHM FOR FINDING LONGEST CYCLES IN CERTAIN BIPARTITE GRAPHS (Q5249271) (← links)
• Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs (Q5265335) (← links)
• Vertex deletion into bipartite permutation graphs (Q6068239) (← links)
• Happy set problem on subclasses of co-comparability graphs (Q6069926) (← links)
• Weighted domination on cocomparability graphs (Q6487953) (← links)
• A closer look at Hamiltonicity and domination through the lens of diameter and convexity (Q6634506) (← links)