Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 50 results in range #1 to #50.

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)

  1. Extremal Kirchhoff index in polycyclic chains: Label: en
  2. One-sided terrain guarding and chordal graphs: Label: en
  3. On the sizes of generalized cactus graphs: Label: en
  4. A new note on 1-planar graphs with minimum degree 7: Label: en
  5. The list \(r\)-hued coloring of \(K_{m, n}\): Label: en
  6. A note on the conditional fault-tolerant strong Menger edge connectivity of regular graphs: Label: en
  7. On the eccentric distance sum of trees with given maximum degree: Label: en
  8. Graph curvature via resistance distance: Label: en
  9. New characterizations and a concept of potential for each multinomial (probabilistic) value: Label: en
  10. Maxima of the \(A_\alpha\)-index of graphs with given size and domination number: Label: en
  11. A branch-and-bound approach to the no-idle flowshop scheduling problem: Label: en
  12. A quadratic simplex algorithm for primal optimization over zero-one polytopes: Label: en
  13. An outer-approximation algorithm for maximum-entropy sampling: Label: en
  14. Extremal numbers for disjoint copies of a clique: Label: en
  15. Tool switching problems with tool order constraints: Label: en
  16. Structural insights about avoiding transfers in the patient-to-room assignment problem: Label: en
  17. Matching extension and matching exclusion via the size or the spectral radius of graphs: Label: en
  18. Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints: Label: en
  19. 2-tone coloring of cactus graphs: Label: en
  20. Automating weight function generation in graph pebbling: Label: en
  21. The complexity of spanning tree problems involving graphical indices: Label: en
  22. Corrigendum on Wiener index, Zagreb indices and Harary index of Eulerian graphs: Label: en
  23. On monotonicity in maker-breaker graph colouring games: Label: en
  24. Irreducibility of recombination Markov chains in the triangular lattice: Label: en
  25. Extremal Digraphs for open neighbourhood location-domination and identifying codes: Label: en
  26. On the oriented achromatic number of graphs: Label: en
  27. Random bipartite Ramsey numbers of long cycles: Label: en
  28. Feedback game on \(3\)-chromatic Eulerian triangulations of surfaces: Label: en
  29. Eigenvalue multiplicity of graphs with given cyclomatic number and given number of quasi-pendant vertices: Label: en
  30. On \(d\)-stable locally checkable problems parameterized by mim-width: Label: en
  31. Paintability of complete bipartite graphs: Label: en
  32. Minimum number of maximal dissociation sets in trees: Label: en
  33. Formulations for the maximum common edge subgraph problem: Label: en
  34. Sprague-Grundy values and complexity for LCTR: Label: en
  35. A weak DP-coloring of planar graphs without 4- and 9-cycles: Label: en
  36. Bounds on the modified second Zagreb index: Label: en
  37. Existence of paths with \(t\) blocks in \(k ( t )\)-chromatic digraph: Label: en
  38. On spectral extrema of graphs with given order and dissociation number: Label: en
  39. Radio number for the Cartesian product of two trees: Label: en
  40. On the skewness of products of graphs: Label: en
  41. Some extremal problems on \(A_\alpha \)-spectral radius of graphs with given size: Label: en
  42. Erdös-Gallai-type problems for distance-edge-monitoring numbers: Label: en
  43. Planar Turán number of the disjoint union of cycles: Label: en
  44. Common domination perfect graphs: Label: en
  45. Generalized fault-tolerance for enhanced hypercubes: Label: en
  46. A characterization of unit interval bigraphs of open and closed intervals: Label: en
  47. On the chromatic number of graphs of odd girth without longer odd holes: Label: en
  48. Extremal polygonal chains with respect to the Kirchhoff index: Label: en
  49. An improved algorithm for finding maximum outerplanar subgraphs: Label: en
  50. Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing: Label: en

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)