HAMILTONian circuits in chordal bipartite graphs
From MaRDI portal
Publication:1923528
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1142299 (Why is no real title available?)
- scientific article; zbMATH DE number 815104 (Why is no real title available?)
- scientific article; zbMATH DE number 3310759 (Why is no real title available?)
- Bipartite permutation graphs
- Characterizations of strongly chordal graphs
- Complement reducible graphs
- Finding Hamiltonian circuits in interval graphs
- Finding Hamiltonian circuits in proper interval graphs
- Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
- Hamilton Paths in Grid Graphs
- Hamiltonian circuits in interval graph generalizations
- Planar Formulae and Their Uses
- Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
- Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs
- Some Examples of Difficult Traveling Salesman Problems
Cited in
(93)- Finding Hamiltonian circuits in quasi-adjoint graphs
- 2-Trees: Structural insights and the study of Hamiltonian paths
- Short cycles dictate dichotomy status of the Steiner tree problem on bisplit graphs
- scientific article; zbMATH DE number 3857154 (Why is no real title available?)
- On the terminal connection problem
- On the minimum eccentricity shortest path problem
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
- Linear structure of bipartite permutation graphs and the longest path problem
- The longest path problem is polynomial on cocomparability graphs
- Hamiltonian circuits and paths in subset graphs with circular adjacency
- Hamiltonian path in permutation graphs
- Full cycle extendability of locally connected \(K_{1,4}\)-restricted graphs
- On 3-degree 4-chordal graphs
- Boundary properties of graphs for algorithmic graph problems
- Hamiltonian properties of locally connected graphs with bounded vertex degree
- The independent quadratic assignment problem: complexity and polynomially solvable special cases
- On the computational difficulty of the terminal connection problem
- The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs
- The edge Hamiltonian path problem is NP-complete for bipartite graphs
- Hamiltonicity in Split Graphs - A Dichotomy
- Detour trees
- Kernelization of two path searching problems on split graphs
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph
- Computing role assignments of split graphs
- The complexity of dissociation set problems in graphs
- Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs
- Path eccentricity of graphs
- On the structure of Hamiltonian graphs with small independence number
- Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs
- On the recognition of search trees generated by BFS and DFS
- Exact algorithms for finding longest cycles in claw-free graphs
- On the minimum eccentricity shortest path problem
- Nonempty intersection of longest paths in series-parallel graphs
- Tractabilities and intractabilities on geometric intersection graphs
- Finding a minimum spanning tree with a small non-terminal set
- Vertex deletion problems on chordal graphs
- On strictly chordality-\(k\) graphs
- Well-partitioned chordal graphs
- On computing longest paths in small graph classes
- Path partition for graphs with special blocks
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs
- A multivariate analysis of the strict terminal connection problem
- The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
- New geometric representations and domination problems on tolerance and multitolerance graphs
- Boundary classes for graph problems involving non-local properties
- On the kernelization of split graph problems
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs
- A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs
- Nontrivial path covers of graphs: existence, minimization and maximization
- Intersection graphs of non-crossing paths
- NP-hard graph problems and boundary classes of graphs
- Vertex deletion problems on chordal graphs
- Assistance and interdiction problems on interval graphs
- A closer look at Hamiltonicity and domination through the lens of diameter and convexity
- An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs
- Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs
- On the structure of Hamiltonian graphs with small independence number
- The longest path problem is polynomial on cocomparability graphs
- Combinatorics and algorithms for quasi-chain graphs
- Combinatorics and algorithms for quasi-chain graphs
- Mim-width. I. Induced path problems
- scientific article; zbMATH DE number 5064035 (Why is no real title available?)
- Contracting to a longest path in H-free graphs
- Chordal bipartite graphs of bounded tree- and clique-width
- Sequentially swapping tokens: further on graph classes
- The longest path problem has a polynomial solution on interval graphs
- Cospectral bipartite graphs with the same degree sequences but with different number of large cycles
- The Longest Path Problem Is Polynomial on Interval Graphs
- Hamiltonian circuits in interval graph generalizations
- On a variant of the minimum path cover problem in acyclic digraphs: computational complexity results and exact method
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs
- Parameterizing path partitions
- Kernelization of graph Hamiltonicity: proper \(H\)-graphs
- Broadcasting in split graphs
- Complexity-separating graph classes for vertex, edge and total colouring
- Tree-layout based graph classes: proper chordal graphs
- Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy
- Some results on connected vertex separators
- Minimum eccentricity shortest paths in some structured graph classes
- Hamiltonian circuits with generalised cost
- Approximation hardness of domination problems on generalized convex graphs
- Edge cover by connected bipartite subgraphs
- Lower bounds on the mim-width of some graph classes
- Algorithms for solving problems on graphs of bounded pathwidth
- Some algorithmic results on Hamiltonicity and its variants in \(P_6\)-free graphs
- Sequentially swapping tokens: further on graph classes
- On the \(k\)-path partition of graphs.
- Complexity of Hamiltonian cycle reconfiguration
- Algorithms for maximum internal spanning tree problem for some graph classes
- Revising Johnson's table for the 21st century
- Impact of diameter and convex ordering for Hamiltonicity and domination
- Hamiltonian circuits, Hamiltonian paths and branching graphs of benzenoid systems
- Cyclability in graph classes
This page was built for publication: HAMILTONian circuits in chordal bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923528)
