The following pages link to Discrete Applied Mathematics (Q96294):
Displaying 50 items.
- Hart and Mas-Colell consistency in PERT problems (Q96298) (← links)
- A tree distinguishing polynomial (Q106322) (← links)
- Quadratization of symmetric pseudo-Boolean functions (Q260013) (← links)
- Strong cliques and equistability of EPT graphs (Q260014) (← links)
- Relating multiway discrepancy and singular values of nonnegative rectangular matrices (Q260016) (← links)
- Regular independent sets (Q260019) (← links)
- Richardson's theorem for \(k\)-colored kernels in strongly connected digraphs (Q260020) (← links)
- Resistance distance in complete \(n\)-partite graphs (Q260022) (← links)
- Counting the number of non-equivalent vertex colorings of a graph (Q260025) (← links)
- A family of efficient six-regular circulants representable as a Kronecker product (Q260026) (← links)
- On the independence polynomial of the corona of graphs (Q260027) (← links)
- On the Estrada index of cactus graphs (Q260033) (← links)
- Ordering trees by their distance spectral radii (Q260039) (← links)
- Exact solutions for latency-bounded target set selection problem on some special families of graphs (Q260041) (← links)
- A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs (Q260042) (← links)
- Revisiting prime power RSA (Q260044) (← links)
- Extremal problems for degree-based topological indices (Q260046) (← links)
- The restricted \(h\)-connectivity of the data center network DCell (Q260051) (← links)
- Per-spectral and adjacency spectral characterizations of a complete graph removing six edges (Q260053) (← links)
- Some extremal graphs with respect to inverse degree (Q260055) (← links)
- On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs (Q260059) (← links)
- Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees (Q260061) (← links)
- On degree resistance distance of cacti (Q260066) (← links)
- König graphs for 3-paths and 3-cycles (Q266789) (← links)
- An approximation algorithm for the longest cycle problem in solid grid graphs (Q266791) (← links)
- Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs (Q266794) (← links)
- Roman \(\{2 \}\)-domination (Q266795) (← links)
- On the competition graphs of \(d\)-partial orders (Q266800) (← links)
- Polynomial-time approximation algorithms for weighted LCS problem (Q266804) (← links)
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- On the minimum and maximum selective graph coloring problems in some graph classes (Q266810) (← links)
- On structural properties of trees with minimal atom-bond connectivity index. II: Bounds on \(B_1\)- and \(B_2\)-branches (Q266812) (← links)
- The unassigned distance geometry problem (Q266818) (← links)
- On some three-color Ramsey numbers for paths (Q266822) (← links)
- Kings and heirs: a characterization of the \((2, 2)\)-domination graphs of tournaments (Q266825) (← links)
- Scheduling a single machine with parallel batching to minimize makespan and total rejection cost (Q266826) (← links)
- On computing the 2-vertex-connected components of directed graphs (Q266828) (← links)
- Binary linear programming models for robust broadcasting in communication networks (Q266832) (← links)
- Provably secure and efficient leakage-resilient certificateless signcryption scheme without bilinear pairing (Q266836) (← links)
- Decision trees with minimum average depth for sorting eight elements (Q266840) (← links)
- Lower bounds on paraclique density (Q266841) (← links)
- The contour of a bridged graph is geodetic (Q266844) (← links)
- Weak saturation number for multiple copies of the complete graph with a star removed (Q266847) (← links)
- A note on adjacent vertex distinguishing colorings of graphs (Q266908) (← links)
- On the first-order edge tenacity of a graph (Q266912) (← links)
- Global cycle properties of locally isometric graphs (Q266915) (← links)
- Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings (Q266919) (← links)
- On the readability of overlap digraphs (Q266924) (← links)
- Complete split graph determined by its (signless) Laplacian spectrum (Q266926) (← links)
- Vehicle scheduling under the warehouse-on-wheels policy (Q266928) (← links)
