The following pages link to Ton Kloks (Q190505):
Displaying 50 items.
- (Q3439683) (← links)
- Probe Ptolemaic Graphs (Q3511358) (← links)
- Partitioned Probe Comparability Graphs (Q3522955) (← links)
- Classifying Rankwidth k-DH-Graphs (Q3569743) (← links)
- Block-Graph Width (Q3630199) (← links)
- Trivially-Perfect Width (Q3651555) (← links)
- (Q4036592) (← links)
- Treewidth and Minimum Fill-in on d-Trapezoid Graphs (Q4215725) (← links)
- (Q4218149) (← links)
- (Q4232780) (← links)
- (Q4246749) (← links)
- (Q4251049) (← links)
- Independent Sets in Asteroidal Triple-Free Graphs (Q4255822) (← links)
- (Q4268436) (← links)
- (Q4281510) (← links)
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree (Q4327821) (← links)
- (Q4373674) (← links)
- (Q4373684) (← links)
- Listing all Minimal Separators of a Graph (Q4388888) (← links)
- Rankings of Graphs (Q4388986) (← links)
- (Q4414505) (← links)
- (Q4448744) (← links)
- Approximations for -Colorings of Graphs (Q4470433) (← links)
- (Q4501549) (← links)
- Independent sets in asteroidal triple-free graphs (Q4572004) (← links)
- Treewidth and pathwidth of permutation graphs (Q4630253) (← links)
- (Q4694712) (← links)
- Approximating the Bandwidth for Asteroidal Triple-Free Graphs (Q4719340) (← links)
- Treewidth of Chordal Bipartite Graphs (Q4845852) (← links)
- Treewidth and Pathwidth of Permutation Graphs (Q4863978) (← links)
- TREEWIDTH OF CIRCLE GRAPHS (Q4886311) (← links)
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs (Q4895809) (← links)
- Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and k-Planar Graphs (Q4914448) (← links)
- (Q4942652) (← links)
- (Q4942656) (← links)
- (Q4944739) (← links)
- (Q4944992) (← links)
- On efficient absorbant conjecture in generalized De Bruijn digraphs (Q4976295) (← links)
- A Guide to Graph Algorithms (Q5015244) (← links)
- Testing superperfection of k-trees (Q5056149) (← links)
- (Q5071562) (← links)
- A simple linear time algorithm for triangulating three-colored graphs (Q5096799) (← links)
- Edge-Clique Covers of the Tensor Product (Q5251635) (← links)
- On Edge-Independent Sets (Q5405939) (← links)
- On Perfect Absorbants in De Bruijn Digraphs (Q5405942) (← links)
- (Q5414591) (← links)
- Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs (Q5434405) (← links)
- Probe Matrix Problems: Totally Balanced Matrices (Q5434455) (← links)
- Computing and Combinatorics (Q5717004) (← links)
- Results on Independent Sets in Categorical Products of Graphs, the Ultimate Categorical Independence Ratio and the Ultimate Categorical Independent Domination Ratio (Q5746261) (← links)
