The following pages link to A remark on a problem of Harary (Q5596082):
Displaying 21 items.
- Bandwidth of convex bipartite graphs and related graphs (Q436544) (← links)
- Bandwidth of graphs resulting from the edge clique covering problem (Q668017) (← links)
- The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness (Q673091) (← links)
- On bandwidth for the tensor product of paths and cycles (Q678881) (← links)
- Bandwidths and profiles of trees (Q1073038) (← links)
- The bandwidth problem and operations on graphs (Q1082355) (← links)
- Complexity of problems in games, graphs and algebraic equations (Q1137948) (← links)
- Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete (Q1168729) (← links)
- Optimal labelling of a product of two paths (Q1214948) (← links)
- Enumerating the kernels of a directed graph with no odd circuits (Q1332748) (← links)
- Harper-type lower bounds and the bandwidths of the compositions of graphs (Q1381861) (← links)
- Selected papers in honor of Manuel Blum on the occasion of his 60th birthday. Selected papers from the international conference in Theoretical Computer Science, Hong Kong, April 20-24, 1998 (Q1572590) (← links)
- Bounding the bandwidths for graphs (Q1583541) (← links)
- Perfect stables in graphs (Q1838296) (← links)
- The bandwidth of a tree with \(k\) leaves is at most \(\lceil \frac k2 \rceil\) (Q1916130) (← links)
- Kernels in graphs with a clique-cutset (Q1923523) (← links)
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (Q1978696) (← links)
- A branch and bound algorithm for the matrix bandwidth minimization (Q2462146) (← links)
- Lower bounds for the bandwidth problem (Q2669517) (← links)
- A Result on the Strength of Graphs by Factorizations of Complete Graphs (Q5051422) (← links)
- Optimization Bounds from the Branching Dual (Q5139843) (← links)
