The following pages link to (Q3328583):
Displayed 50 items.
- Powers of cycles, powers of paths, and distance graphs (Q531605) (← links)
- Fractional weak discrepancy and split semiorders (Q531608) (← links)
- The algorithmic complexity of mixed domination in graphs (Q533883) (← links)
- Common intervals of multiple permutations (Q534763) (← links)
- Exact approaches for integrated aircraft fleeting and routing at TunisAir (Q540645) (← links)
- Inverse \(M\)-matrices. II (Q551242) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- Bigraphs/digraphs of Ferrers dimension 2 and asteroidal triple of edges (Q556849) (← links)
- Chordality properties on graphs and minimal conceptual connections in semantic data models (Q579964) (← links)
- Completion of partial matrices to contractions (Q580679) (← links)
- An efficient procedure for the N-city traveling salesman problem (Q583107) (← links)
- An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem (Q583125) (← links)
- The polytope of degree sequences (Q584289) (← links)
- Computing the boxicity of a graph by covering its complement by cointerval graphs (Q585228) (← links)
- Space graphs and sphericity (Q595671) (← links)
- Reconstructibility and perfect graphs (Q595687) (← links)
- The hardness of approximating the boxicity, cubicity and threshold dimension of a graph (Q602742) (← links)
- The off-line group seat reservation problem (Q613435) (← links)
- Some good characterization results relating to the Kőnig-Egerváry theorem (Q623797) (← links)
- On conditional covering problem (Q626967) (← links)
- On parallel recognition of cographs (Q627166) (← links)
- A characterization of graphs with rank 4 (Q630525) (← links)
- The elliptic matrix completion problem (Q630533) (← links)
- Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537) (← links)
- Approximation of RNA multiple structural alignment (Q655441) (← links)
- Minimum clique partition in unit disk graphs (Q659693) (← links)
- Chordal bipartite graphs with high boxicity (Q659714) (← links)
- Boxicity of circular arc graphs (Q659754) (← links)
- Minimum 2-tuple dominating set of an interval graph (Q666518) (← links)
- Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659) (← links)
- Tree 3-spanners on interval, permutation and regular bipartite graphs (Q671393) (← links)
- A linear time algorithm for finding all hinge vertices of a permutation graph (Q671396) (← links)
- An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs (Q671937) (← links)
- Edge domination on bipartite permutation graphs and cotriangulated graphs (Q672265) (← links)
- A linear-time algorithm for proper interval graph recognition (Q672268) (← links)
- On some decision problems for trace codings (Q672324) (← links)
- Restrictions of graph partition problems. I (Q672380) (← links)
- Simple linear time recognition of unit interval graphs (Q672408) (← links)
- Efficient parallel algorithms for doubly convex-bipartite graphs (Q672468) (← links)
- Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph (Q672487) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- The total interval number of a tree and the Hamiltonian completion number of its line graph (Q672831) (← links)
- A note on lexicographic breadth first search for chordal graphs (Q673001) (← links)
- A linear time algorithm to compute a dominating path in an AT-free graph (Q673002) (← links)
- On the equivalence covering number of splitgraphs (Q673014) (← links)
- Complete problems for monotone NP (Q673092) (← links)
- \(K_{1,3}\)-free and \(W_4\)-free graphs (Q673353) (← links)
- Efficient algorithms for shortest distance queries on special classes of polygons (Q673766) (← links)
- An algorithm for finding homogeneous pairs (Q674438) (← links)
- Two remarks on circular arc graphs (Q675889) (← links)