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. Graphs \(G\) with nullity \(2c(G) + p(G) - 1\): Label: en
  2. No-hole \(k\)-tuple \((r+1)\)-distant colorings of odd cycles: Label: en
  3. No-hole \(k\)-tuple \((r+1)\)-distant colorings: Label: en
  4. Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds: Label: en
  5. On the diameter of a domination dot-critical graph: Label: en
  6. On the restricted homomorphism problem: Label: en
  7. Extremal vertex-degree function index with given order and dissociation number: Label: en
  8. Injective chromatic index of sparse graphs: Label: en
  9. The minimum ABC index of chemical trees: Label: en
  10. On the \(\alpha\)-index of minimally 2-connected graphs with given order or size: Label: en
  11. Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices: Label: en
  12. Upper bounds on the diameter of domination dot-critical graphs with given connectivity: Label: en
  13. Families of finite sets satisfying intersection restrictions: Label: en
  14. Channel assignment problem and relaxed 2-distant coloring of graphs: Label: en
  15. No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\): Label: en
  16. On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\): Label: en
  17. Binary trees with the largest number of subtrees: Label: en
  18. Superconnectivity of graphs with odd girth \(g\) and even girth \(h\): Label: en
  19. On 3-uniform hypergraphs without a cycle of a given length: Label: en
  20. On the maximum number of edges in a hypergraph with given matching number: Label: en
  21. On the termination of some biclique operators on multipartite graphs: Label: en
  22. Antimagic labeling for subdivisions of graphs: Label: en
  23. Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes: Label: en
  24. Monochromatic graph decompositions inspired by anti-Ramsey colorings: Label: en
  25. Maximum locally irregular induced subgraphs via minimum irregulators: Label: en
  26. The degree sequence of the preferential attachment model: Label: en
  27. Computing the matching and independence polynomials of double hexagonal chains: Label: en
  28. A note on stability results for Berge-\( K_{s , t}\) hypergraphs: Label: en
  29. The \(\varepsilon\)-spectral radius of trees with perfect matchings: Label: en
  30. Spanning trees of bipartite graphs with a bounded number of leaves and branch vertices: Label: en
  31. Upper bounds and approximation results for the \(k\)-slow burning problem: Label: en
  32. List recoloring of planar graphs: Label: en
  33. The clique number of the exact distance \(t\)-power graph: complexity and eigenvalue bounds: Label: en
  34. Games restricted by simplicial complexes and an application to vertiport cooperation: Label: en
  35. Computing the minimal perimeter polygon for digital objects in the triangular tiling: Label: en
  36. Small matchings extend to Hamiltonian cycles in hypercubes with disjoint faulty edges: Label: en
  37. Twin-width of graphs with tree-structured decompositions: Label: en
  38. On the potential function \(\sigma ( H , m , n )\) of an arbitrary bipartite graph \(H\): Label: en
  39. Subnetwork reliability analysis of star networks: Label: en
  40. More on the complexity of defensive domination in graphs: Label: en
  41. TurĂ¡n problem of signed graph for negative odd cycle: Label: en
  42. Cyclic base ordering of certain degenerate graphs: Label: en
  43. A note on universal graphs for spanning trees: Label: en
  44. Ramsey and Gallai-Ramsey numbers for comb and sun graphs: Label: en
  45. A new condition on dominated pair degree sum for a digraph to be supereulerian: Label: en
  46. Bounds for eccentricity-based parameters of graphs: Label: en
  47. Resistance distance in generalized core-satellite graphs: Label: en
  48. Renting servers in the cloud: the case of equal duration jobs: Label: en
  49. A computational study on integer programming formulations for hop-constrained survivable network design: Label: en
  50. Characterization of graphs with the limited normalized algebraic connectivity: Label: en

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