Pages that link to "Item:Q1923528"
From MaRDI portal
The following pages link to HAMILTONian circuits in chordal bipartite graphs (Q1923528):
Displaying 50 items.
- Detour trees (Q277622) (← links)
- Computing role assignments of split graphs (Q287443) (← links)
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696) (← links)
- Boundary properties of graphs for algorithmic graph problems (Q551178) (← links)
- An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs (Q626964) (← links)
- Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs (Q628259) (← links)
- The longest path problem has a polynomial solution on interval graphs (Q639287) (← links)
- Hamiltonian properties of locally connected graphs with bounded vertex degree (Q643015) (← links)
- Edge cover by connected bipartite subgraphs (Q646717) (← links)
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
- Nonempty intersection of longest paths in series-parallel graphs (Q729758) (← links)
- On the terminal connection problem (Q831820) (← links)
- Cyclability in graph classes (Q833007) (← links)
- Finding Hamiltonian circuits in quasi-adjoint graphs (Q955323) (← links)
- On the \(k\)-path partition of graphs. (Q1401225) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- Path partition for graphs with special blocks (Q1765521) (← links)
- Vertex deletion problems on chordal graphs (Q1786595) (← links)
- Chordal bipartite graphs of bounded tree- and clique-width (Q1827785) (← links)
- The longest path problem is polynomial on cocomparability graphs (Q1939666) (← links)
- Exact algorithms for finding longest cycles in claw-free graphs (Q1939671) (← links)
- The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649) (← links)
- On the recognition of search trees generated by BFS and DFS (Q2087463) (← links)
- Algorithms for maximum internal spanning tree problem for some graph classes (Q2091107) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Some algorithmic results on Hamiltonicity and its variants in \(P_6\)-free graphs (Q2093879) (← links)
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (Q2118390) (← links)
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (Q2125230) (← links)
- Well-partitioned chordal graphs (Q2144581) (← links)
- Mim-width. I. Induced path problems (Q2174563) (← links)
- On strictly chordality-\(k\) graphs (Q2181248) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs (Q2268855) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs (Q2283031) (← links)
- Cospectral bipartite graphs with the same degree sequences but with different number of large cycles (Q2287757) (← links)
- Nontrivial path covers of graphs: existence, minimization and maximization (Q2292153) (← links)
- A multivariate analysis of the strict terminal connection problem (Q2306846) (← links)
- Linear structure of bipartite permutation graphs and the longest path problem (Q2379947) (← links)
- Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
- On the minimum eccentricity shortest path problem (Q2404081) (← links)
- Lower bounds on the mim-width of some graph classes (Q2413964) (← links)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
- Complexity of Hamiltonian cycle reconfiguration (Q2633261) (← links)
- On the kernelization of split graph problems (Q2636501) (← links)
- New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs (Q2820855) (← links)
- Minimum Eccentricity Shortest Paths in Some Structured Graph Classes (Q2827811) (← links)
- Hamiltonicity in Split Graphs - A Dichotomy (Q2971662) (← links)
- The Longest Path Problem is Polynomial on Cocomparability Graphs (Q3057610) (← links)
