The following pages link to (Q5422499):
Displayed 50 items.
- Second-order and local characteristics of network intensity functions (Q65816) (← links)
- Multiplex PI control for consensus in networks of heterogeneous linear agents (Q259481) (← links)
- A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs (Q260042) (← links)
- Rainbow \(C_4\)'s and directed \(C_4\)'s: the bipartite case study (Q262974) (← links)
- The \((k,\ell)\)-rainbow index of random graphs (Q263013) (← links)
- Trees with 2-reinforcement number three (Q263026) (← links)
- Acyclically 4-colorable triangulations (Q264190) (← links)
- On Barnette's conjecture and the \(H^{+-}\) property (Q266009) (← links)
- The 3-rainbow index and connected dominating sets (Q266041) (← links)
- The 2-good-neighbor diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM\(^\ast\) model (Q266281) (← links)
- Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs (Q266794) (← links)
- Global cycle properties of locally isometric graphs (Q266915) (← links)
- On the readability of overlap digraphs (Q266924) (← links)
- Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (Q266943) (← links)
- Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
- Global cycle properties in locally connected, locally traceable and locally Hamiltonian graphs (Q266958) (← links)
- Circumferences of 3-connected claw-free graphs (Q267172) (← links)
- 3-paths in graphs with bounded average degree (Q274685) (← links)
- Large degree vertices in longest cycles of graphs. I (Q274689) (← links)
- The Steiner Wiener index of a graph (Q274705) (← links)
- Dicycle cover of Hamiltonian oriented graphs (Q275871) (← links)
- On the common neighborhood graphs (Q277504) (← links)
- Adjacency polynomials of digraph transformations (Q277610) (← links)
- On the extreme eccentric distance sum of graphs with some given parameters (Q277627) (← links)
- On the further relation between the (revised) Szeged index and the Wiener index of graphs (Q277640) (← links)
- Clique cover products and unimodality of independence polynomials (Q277643) (← links)
- The maximum matching energy of bicyclic graphs with even girth (Q277654) (← links)
- Neighbor sum distinguishing total choosability of planar graphs without 4-cycles (Q277657) (← links)
- Kernelization of the 3-path vertex cover problem (Q279214) (← links)
- Super connectivity of Kronecker product of complete bipartite graphs and complete graphs (Q279219) (← links)
- Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions (Q279915) (← links)
- On purely tree-colorable planar graphs (Q280945) (← links)
- Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic (Q281776) (← links)
- Sizes and transmissions of digraphs with a given clique number (Q281810) (← links)
- \((3, 1)^*\)-choosability of graphs of nonnegative characteristic without intersecting short cycles (Q282304) (← links)
- Closed formulae for the local metric dimension of corona product graphs (Q283660) (← links)
- Paired many-to-many disjoint path covers in restricted hypercube-like graphs (Q284574) (← links)
- Ore-type degree condition of supereulerian digraphs (Q284720) (← links)
- Graphs whose characteristic and permanental polynomials have coefficients of the same magnitude (Q284749) (← links)
- A parallel algorithm for solving the coloring problem on trapezoid graphs (Q287107) (← links)
- Computing role assignments of split graphs (Q287443) (← links)
- The normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chains (Q290102) (← links)
- Orienting graphs to optimize reachability (Q290248) (← links)
- Cycle covers. II: Circuit chain, Petersen chain and Hamilton weights. (Q290803) (← links)
- Excluded-minor characterization of apex-outerplanar graphs (Q292261) (← links)
- Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected (Q292269) (← links)
- Optimal 1-Hamiltonian graphs (Q293225) (← links)
- Free choosability of outerplanar graphs (Q293600) (← links)
- Extendability of contractible configurations for nowhere-zero flows and modulo orientations (Q293640) (← links)
- A note on the size of edge-chromatic 4-critical graphs (Q294519) (← links)