The following pages link to Discrete Applied Mathematics (Q96294):
Displaying 50 items.
- Clique-width of path powers (Q266933) (← links)
- Induced 2-regular subgraphs in \(k\)-chordal cubic graphs (Q266935) (← links)
- Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes (Q266936) (← links)
- On self-clique shoal graphs (Q266940) (← links)
- Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (Q266943) (← links)
- List rankings and on-line list rankings of graphs (Q266945) (← links)
- On the roots of domination polynomial of graphs (Q266947) (← links)
- Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
- Minimum strictly fundamental cycle bases of planar graphs are hard to find (Q266952) (← links)
- Estimation of Laplacian spectra of direct and strong product graphs (Q266954) (← links)
- Global cycle properties in locally connected, locally traceable and locally Hamiltonian graphs (Q266958) (← links)
- The \((1, 2)\)-step competition graph of a pure local tournament that is not round decomposable (Q266961) (← links)
- Minimum degree distance among cacti with perfect matchings (Q266964) (← links)
- Averaging 2-rainbow domination and Roman domination (Q266967) (← links)
- Adaptive group testing with a constrained number of positive responses improved (Q266968) (← links)
- House-swapping with divorcing and engaged pairs (Q277606) (← links)
- On Wiener and multiplicative Wiener indices of graphs (Q277607) (← links)
- Adjacency polynomials of digraph transformations (Q277610) (← links)
- Complexity aspects of the triangle path convexity (Q277613) (← links)
- Intersection graphs of L-shapes and segments in the plane (Q277615) (← links)
- Disjoint Hamilton cycles in transposition graphs (Q277617) (← links)
- On \(r\)-dynamic coloring of graphs (Q277619) (← links)
- Detour trees (Q277622) (← links)
- Dynamic coloring of graphs having no \(K_5\) minor (Q277625) (← links)
- On the extreme eccentric distance sum of graphs with some given parameters (Q277627) (← links)
- Pattern restricted Stirling \(k\)-ary words, the plateau statistic and the kernel method (Q277629) (← links)
- Improving the characterization of P-stability for applications in network privacy (Q277631) (← links)
- On del-robust primitive words (Q277635) (← links)
- Core-based criterion for extreme supermodular functions (Q277638) (← links)
- On the further relation between the (revised) Szeged index and the Wiener index of graphs (Q277640) (← links)
- A minimax result for perfect matchings of a polyomino graph (Q277641) (← links)
- Clique cover products and unimodality of independence polynomials (Q277643) (← links)
- Largest domination number and smallest independence number of forests with given degree sequence (Q277645) (← links)
- On the uniqueness of some girth eight algebraically defined graphs (Q277648) (← links)
- On the distance spread of cacti and bicyclic graphs (Q277650) (← links)
- The maximum matching energy of bicyclic graphs with even girth (Q277654) (← links)
- On the geodetic iteration number of the contour of a graph (Q277655) (← links)
- Neighbor sum distinguishing total choosability of planar graphs without 4-cycles (Q277657) (← links)
- The majority game with an arbitrary majority (Q284827) (← links)
- Game total domination for cycles and paths (Q284829) (← links)
- Strong equality of Roman and weak Roman domination in trees (Q284830) (← links)
- A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs (Q284833) (← links)
- Multitasking via alternate and shared processing: algorithms and complexity (Q284835) (← links)
- A polyhedral investigation of star colorings (Q284838) (← links)
- On the skew-permanental polynomials of orientation graphs (Q284839) (← links)
- Chosen IV cryptanalysis on reduced round \texttt{ChaCha} and \texttt{Salsa} (Q284840) (← links)
- Scheduling under a non-reversible energy source: an application of piecewise linear bounding of non-linear demand/cost functions (Q284842) (← links)
- Initial non-repetitive complexity of infinite words (Q284845) (← links)
- Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations (Q284850) (← links)
- Correction to ``On the distance Laplacian spectral radius of bipartite graphs'' (Q284854) (← links)
