The following pages link to Ton Kloks (Q190505):
Displaying 50 items.
- Bandwidth of chain graphs (Q293476) (← links)
- Finding and counting small induced subgraphs efficiently (Q294749) (← links)
- New parameterized algorithms for the edge dominating set problem (Q392035) (← links)
- Block-graph width (Q534563) (← links)
- (Q672486) (redirect page) (← links)
- Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph (Q672487) (← links)
- On the equivalence covering number of splitgraphs (Q673014) (← links)
- \(K_{1,3}\)-free and \(W_4\)-free graphs (Q673353) (← links)
- The combinatorics of N. G. de Bruijn (Q740470) (← links)
- Semitotal domination on AT-free graphs and circle graphs (Q831692) (← links)
- Edge-clique covers of the tensor product (Q897963) (← links)
- Partitioned probe comparability graphs (Q924151) (← links)
- On probe permutation graphs (Q967305) (← links)
- Efficient algorithms for Roman domination on some classes of graphs (Q1003729) (← links)
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences (Q1026014) (← links)
- A class of graphs containing the polar spaces (Q1084420) (← links)
- Treewidth. Computations and approximations (Q1338451) (← links)
- A generalization of AT-free graphs and a generic algorithm for solving triangulation problems (Q1348907) (← links)
- Measuring the vulnerability for classes of intersection graphs (Q1364473) (← links)
- On treewidth and minimum fill-in of asteroidal triple-free graphs (Q1392207) (← links)
- On retracts, absolute retracts, and foldings in cographs (Q1749782) (← links)
- On complexities of minus domination (Q1751171) (← links)
- Computing the branchwidth of interval graphs (Q1764810) (← links)
- An infinite sequence of \(\Gamma{}\Delta{}\)-regular graphs (Q1812527) (← links)
- Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs (Q1849745) (← links)
- On the vertex ranking problem for trapezoid, circular-arc and other graphs (Q1961233) (← links)
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs (Q1962057) (← links)
- Complexity of paired domination in AT-free and planar graphs (Q2166758) (← links)
- A note on the geodetic number and the Steiner number of AT-free graphs (Q2220867) (← links)
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs (Q2253902) (← links)
- On maximum independent set of categorical product and ultimate categorical ratios of graphs (Q2348262) (← links)
- On the Grundy number of Cameron graphs (Q2413405) (← links)
- On the complexity of the black-and-white coloring problem on some classes of perfect graphs (Q2445872) (← links)
- Kernels in planar digraphs (Q2485283) (← links)
- Improved bottleneck domination algorithms (Q2499580) (← links)
- (Q2741323) (← links)
- (Q2741345) (← links)
- (Q2766686) (← links)
- Rainbow Domination and Related Problems on Some Classes of Perfect Graphs (Q2798024) (← links)
- Gray Codes for AT-Free Orders via Antimatroids (Q2798220) (← links)
- On Independence Domination (Q2842784) (← links)
- On Retracts, Absolute Retracts, and Folds in Cographs (Q2864312) (← links)
- On Complexities of Minus Domination (Q2867118) (← links)
- (Q2878127) (← links)
- The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs (Q2898008) (← links)
- Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs (Q2914320) (← links)
- Convex Independence in Permutation Graphs (Q2958358) (← links)
- New Parameterized Algorithms for the Edge Dominating Set Problem (Q3088075) (← links)
- A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs (Q3141527) (← links)
- On Some Simple Widths (Q3404447) (← links)
