Finding Hamiltonian circuits in proper interval graphs
From MaRDI portal
(Redirected from Publication:1050117)
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3566474 (Why is no real title available?)
- scientific article; zbMATH DE number 3571501 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- Algorithms for a maximum clique and a maximum independent set of a circle graph
- Algorithms on circular-arc graphs
- An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs
- An Efficient Test for Circular-Arc Graphs
- Coloring a Family of Circular Arcs
- Minimum node disjoint path covering for circular-arc graphs
- On the complexity of computing the measure of ∪[a i ,b i ]
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The Planar Hamiltonian Circuit Problem is NP-Complete
- The edge Hamiltonian path problem is NP-complete
Cited in
(39)- The Longest Path Problem Is Polynomial on Interval Graphs
- Path eccentricity of graphs
- Blowup algebras of determinantal ideals in prime characteristic
- Finding Hamiltonian circuits in quasi-adjoint graphs
- Some parallel algorithms on interval graphs
- HAMILTONian circuits in chordal bipartite graphs
- An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals
- The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
- Full cycle extendability of locally connected \(K_{1,4}\)-restricted graphs
- Efficient parallel recognition of some circular arc graphs. I
- Proper interval graphs and the guard problem
- Semi-proper interval graphs
- Intersection graphs of non-crossing paths
- A linear time recognition algorithm for proper interval graphs
- Frobenius methods in combinatorics
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs
- The longest path problem is polynomial on cocomparability graphs
- Random Generation and Enumeration of Proper Interval Graphs
- Graphs with at most two moplexes
- Computing and counting longest paths on circular-arc graphs in polynomial time
- Paths in interval graphs and circular arc graphs
- Hamiltonian properties of locally connected graphs with bounded vertex degree
- On the domatic number of interval graphs
- A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs
- Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs
- Connected proper interval graphs and the guard problem in spiral polygons (extended abstract)
- Finding Hamiltonian circuits in interval graphs
- Representations of graphs and networks (coding, layouts and embeddings)
- Mathematical properties on the hyperbolicity of interval graphs
- Algorithms for finding disjoint path covers in unit interval graphs
- On computing longest paths in small graph classes
- A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs
- A simple algorithm to find Hamiltonian cycles in proper interval graphs
- The longest path problem has a polynomial solution on interval graphs
- Tropical paths in vertex-colored graphs
- Kernelization of graph Hamiltonicity: proper \(H\)-graphs
- Hamiltonian paths, unit-interval complexes, and determinantal facet ideals
- Hamiltonian circuits in interval graph generalizations
- The longest path problem is polynomial on cocomparability graphs
This page was built for publication: Finding Hamiltonian circuits in proper interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1050117)
