Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
From MaRDI portal
Recommendations
- Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
- scientific article; zbMATH DE number 1308950
- An $O(n^2 \log n)$ Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs
- scientific article; zbMATH DE number 4075117
- 1-tough cocomparability graphs are hamiltonian
Cited in
(43)- Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
- Partial and perfect path covers of cographs
- Hamiltonian powers in threshold and arborescent comparability graphs
- 1-tough cocomparability graphs are hamiltonian
- Weighted domination of cocomparability graphs
- Jump number maximization for proper interval graphs and series-parallel graphs
- Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
- Toughness, hamiltonicity and split graphs
- HAMILTONian circuits in chordal bipartite graphs
- The longest path problem is polynomial on cocomparability graphs
- Revising Johnson's table for the 21st century
- Happy set problem on subclasses of co-comparability graphs
- Vertex deletion into bipartite permutation graphs
- Mim-width. I. Induced path problems
- Complexity-separating graph classes for vertex, edge and total colouring
- Computing and counting longest paths on circular-arc graphs in polynomial time
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
- Solving the path cover problem on circular-arc graphs by using an approximation algorithm
- Complete edge-colored permutation graphs
- Succinct permutation graphs
- New geometric representations and domination problems on tolerance and multitolerance graphs
- The longest path problem is polynomial on cocomparability graphs
- scientific article; zbMATH DE number 6004865 (Why is no real title available?)
- scientific article; zbMATH DE number 4075117 (Why is no real title available?)
- A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
- scientific article; zbMATH DE number 1308950 (Why is no real title available?)
- A linear-time algorithm for maximum-cardinality matching on cocomparability graphs
- Independent sets in asteroidal triple-free graphs
- Full cycle extendability of locally connected \(K_{1,4}\)-restricted graphs
- An algorithm for finding longest cycles in certain bipartite graphs
- Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs
- Vertex deletion into bipartite permutation graphs
- Happy set problem on subclasses of co-comparability graphs
- Hamiltonian properties of locally connected graphs with bounded vertex degree
- Weighted domination on cocomparability graphs
- A closer look at Hamiltonicity and domination through the lens of diameter and convexity
- Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs
- On platypus graphs and the Steiner-Deogun property
- Hamiltonian path in permutation graphs
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs
- Cyclability in graph classes
- On the intersection of tolerance and cocomparability graphs
- Finding Hamiltonian circuits in quasi-adjoint graphs
This page was built for publication: Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4302282)
