Pages that link to "Item:Q1923528"
From MaRDI portal
The following pages link to HAMILTONian circuits in chordal bipartite graphs (Q1923528):
Displaying 24 items.
- ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES (Q3065608) (← links)
- The Longest Path Problem Is Polynomial on Interval Graphs (Q3182942) (← links)
- On the Minimum Eccentricity Shortest Path Problem (Q3449826) (← links)
- The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs (Q3507334) (← links)
- Kernelization of Two Path Searching Problems on Split Graphs (Q4632190) (← links)
- (Q4691777) (← links)
- (Q4691817) (← links)
- Kernelization of Graph Hamiltonicity: Proper $H$-Graphs (Q4986812) (← links)
- Vertex Deletion Problems on Chordal Graphs (Q5136314) (← links)
- Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs (Q5265335) (← links)
- Combinatorics and algorithms for quasi-chain graphs (Q5918620) (← links)
- Combinatorics and algorithms for quasi-chain graphs (Q5925628) (← links)
- Some results on connected vertex separators (Q6040587) (← links)
- On the computational difficulty of the terminal connection problem (Q6041044) (← links)
- Intersection graphs of non-crossing paths (Q6041577) (← links)
- Broadcasting in split graphs (Q6057341) (← links)
- Contracting to a longest path in H-free graphs (Q6065420) (← links)
- Assistance and interdiction problems on interval graphs (Q6094722) (← links)
- Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy (Q6114853) (← links)
- Short cycles dictate dichotomy status of the Steiner tree problem on bisplit graphs (Q6132536) (← links)
- 2-Trees: Structural insights and the study of Hamiltonian paths (Q6132868) (← links)
- Path eccentricity of graphs (Q6162021) (← links)
- Sequentially swapping tokens: further on graph classes (Q6169527) (← links)
- On 3-degree 4-chordal graphs (Q6174132) (← links)
