Pages that link to "Item:Q1923528"
From MaRDI portal
The following pages link to HAMILTONian circuits in chordal bipartite graphs (Q1923528):
Displayed 23 items.
- 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)
- Finding Hamiltonian circuits in quasi-adjoint graphs (Q955323) (← links)
- On the \(k\)-path partition of graphs. (Q1401225) (← links)
- Path partition for graphs with special blocks (Q1765521) (← 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)
- 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)
- Linear structure of bipartite permutation graphs and the longest path problem (Q2379947) (← 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)
- The Longest Path Problem is Polynomial on Cocomparability Graphs (Q3057610) (← links)
- ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES (Q3065608) (← links)
- The Longest Path Problem Is Polynomial on Interval Graphs (Q3182942) (← links)
- The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs (Q3507334) (← links)