The following pages link to (Q4869540):
Displaying 50 items.
- An algorithm for computing cutpoints in finite metric spaces (Q263276) (← links)
- On approximating tree spanners that are breadth first search trees (Q269500) (← links)
- On the ordered list subgraph embedding problems (Q270006) (← links)
- Sharp lower bounds on the Narumi-Katayama index of graph operations (Q274395) (← links)
- The bipartite edge frustration of hierarchical product of graphs (Q277458) (← links)
- Distributed stopping for average consensus in undirected graphs via event-triggered strategies (Q290843) (← links)
- Uniquely tree-saturated graphs (Q292245) (← links)
- A cyclic solution for an infinite class of Hamilton-Waterloo problems (Q292248) (← links)
- Steiner tree problem with minimum number of Steiner points and bounded edge-length (Q294609) (← links)
- Interval edge-colorings of complete graphs (Q297922) (← links)
- Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles (Q297926) (← links)
- I,F-partitions of sparse graphs (Q298327) (← links)
- Vertex-distinguishing proper arc colorings of digraphs (Q298989) (← links)
- Normal matrices subordinate to a tree and flat portions of the field of values (Q306445) (← links)
- Qualitative behavior of a smoking model (Q307421) (← links)
- Stochastic stability for pantograph multi-group models with dispersal and stochastic perturbation (Q308258) (← links)
- The label cut problem with respect to path length and label frequency (Q313969) (← links)
- Strong Allee effect in a stochastic logistic model with mate limitation and stochastic immigration (Q316947) (← links)
- On graphs whose graphoidal domination number is one (Q321997) (← links)
- On the hereditary \((p,q)\)-Helly property of hypergraphs, cliques, and bicliques (Q324846) (← links)
- On \((k,d)\)-Skolem graceful graphs (Q324916) (← links)
- Global 2-point set domination number of a graph (Q327650) (← links)
- Domination in graphoidally covered graphs: least-kernel graphoidal covers (Q327691) (← links)
- Barrel pseudotilings (Q350624) (← links)
- Some new perspectives on global domination in graphs (Q361579) (← links)
- On super \((a, d)\)-edge-antimagic total labeling of special types of crown graphs (Q364571) (← links)
- The existence of \((K_2\times K_6)\)-designs (Q367091) (← links)
- Extending the type reproduction number to infectious disease control targeting contacts between types (Q378294) (← links)
- General graph pebbling (Q385150) (← links)
- Characterization of common-edge sigraph (Q385160) (← links)
- Finite prime distance graphs and 2-odd graphs (Q390314) (← links)
- Algorithmic complexity of proper labeling problems (Q391137) (← links)
- Fast-mixed searching and related problems on graphs (Q393051) (← links)
- A new result on the problem of Buratti, Horak and Rosa (Q394341) (← links)
- Lattices, whose incomparability graphs have horns (Q396689) (← links)
- On the size of 3-uniform linear hypergraphs (Q396731) (← links)
- Interval edge-colorings of \(K_{1, m, n}\) (Q400539) (← links)
- On the Buratti-Horak-Rosa conjecture about Hamiltonian paths in complete graphs (Q405227) (← links)
- Analysis of autonomous Lotka-Volterra competition systems with random perturbation (Q412431) (← links)
- Lexicographic products with high reconstruction numbers (Q418863) (← links)
- Super restricted edge connectivity of regular edge-transitive graphs (Q423941) (← links)
- Edge-disjoint spanning trees and eigenvalues of regular graphs (Q426054) (← links)
- Stochastically asymptotically stability of the multi-group SEIR and SIR models with random perturbation (Q434775) (← links)
- Global stability of coupled nonlinear systems with Markovian switching (Q434798) (← links)
- On the complexity and algorithm of grooming regular traffic in WDM optical networks (Q436806) (← links)
- Multicut in trees viewed through the eyes of vertex cover (Q440014) (← links)
- Endpoint extendable paths in dense graphs (Q442374) (← links)
- Dynamics of a multigroup SIR epidemic model with stochastic perturbation (Q445046) (← links)
- Generalization of Erdős-Gallai edge bound (Q458592) (← links)
- Spanning closed walks and TSP in 3-connected planar graphs (Q462924) (← links)
