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. Tashkinov-trees: an annotated proof: Label: en
  2. Turán numbers of several bipartite graphs: Label: en
  3. Cographs and 1-sums: Label: en
  4. On the Turán number of \(K_m \vee C_{2k-1}\): Label: en
  5. \(l_1\)-embeddability of shifted quadrilateral cylinder graphs: Label: en
  6. Complexity of total dominator coloring in graphs: Label: en
  7. Path planning in a weighted planar subdivision under the Manhattan metric: Label: en
  8. Compatible spanning circuits and forbidden induced subgraphs: Label: en
  9. Fixing numbers of graphs with symmetric and generalized quaternion symmetry groups: Label: en
  10. A construction of optimal 1-spontaneous emission error designs: Label: en
  11. Equality of ordinary and symbolic powers of some classes of monomial ideals: Label: en
  12. Antidirected Hamiltonian paths and cycles of digraphs with \(\alpha_2\)-stable number 2: Label: en
  13. The zero forcing number of graphs with the matching number and the cyclomatic number: Label: en
  14. Common kings of a chain of cycles in a strong tournament: Label: en
  15. On the linear arboricity of graphs with treewidth at most four: Label: en
  16. A sufficient condition for vertex bipancyclicity in balanced bipartite graphs: Label: en
  17. Resonance graphs on perfect matchings of graphs on surfaces: Label: en
  18. Loose edge-connection of graphs: Label: en
  19. Homotopy and Hom construction in the category of finite hypergraphs: Label: en
  20. New results on complementarity spectra of connected graphs: Label: en
  21. Signed graphs with all but two eigenvalues equal to \(\pm 1\): Label: en
  22. Isomorphisms and properties of TAR graphs for zero forcing and other \(X\)-set parameters: Label: en
  23. Factors with red-blue coloring of claw-free graphs and cubic graphs: Label: en
  24. The Weisfeiler-Leman dimension of distance-hereditary graphs: Label: en
  25. The distribution of roots of Ehrhart polynomials for the dual of root polytopes of type \(C\): Label: en
  26. Improved lower bounds on the extrema of eigenvalues of graphs: Label: en
  27. Maximal fractional cross-intersecting families: Label: en
  28. Undirected determinant and its complexity: Label: en
  29. On inducing degenerate sums through 2-labellings: Label: en
  30. Borodin-Kostochka conjecture holds for odd-hole-free graphs: Label: en
  31. Infinite Ramsey-minimal graphs for star forests: Label: en
  32. Multipermutations and Stirling multipermutations: Label: en
  33. Lattice path bicircular matroids: Label: en
  34. Parallel connectivity in edge-colored complete graphs: complexity results: Label: en
  35. The strong spectral property of graphs: graph operations and barbell partitions: Label: en
  36. A novel count of the spanning trees of a cube: Label: en
  37. The oriented diameter of graphs with given connected domination number and distance domination number: Label: en
  38. Crossing and intersecting families of geometric graphs on point sets: Label: en
  39. Variable degeneracy on toroidal graphs: Label: en
  40. Size Gallai-Ramsey number: Label: en
  41. The chromatic number of a graph with two odd holes and an odd girth: Label: en
  42. Proper cycles and rainbow cycles in 2-triangle-free edge-colored complete graphs: Label: en
  43. Mutually orthogonal Sudoku Latin squares and their graphs: Label: en
  44. Erdős-Hajnal problem for \(H\)-free hypergraphs: Label: en
  45. Signed Ramsey numbers: Label: en
  46. Four-vertex traces of finite sets: Label: en
  47. Weak-dynamic coloring of graphs beyond-planarity: Label: en
  48. Some new constructions of difference systems of sets: Label: en
  49. The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices: Label: en
  50. Dominating sets inducing large component in graphs with minimum degree two: Label: en

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