Entity usage

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.

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

The sharp upper bounds on the \(A_{\alpha}\)-spectral radius of \(C_4\)-free graphs and Halin graphs: Label: en
Upper bound on the diameter of a domination dot-critical graph: Label: en
Maximizing the number of independent sets of fixed size in connected graphs with given independence number: Label: en
Vertex pancyclicity of quadrangularly connected claw-free graphs: Label: en
The maximum spectral radius of graphs without spanning linear forests: Label: en
Turán numbers of complete 3-uniform Berge-hypergraphs: Label: en
The smallest uniform color-bounded hypergraphs which are one-realizations of a given set: Label: en
Representing graphs in Steiner triple systems: Label: en
The minimal number of subtrees with a given degree sequence: Label: en
On the permutations that strongly avoid the pattern 312 or 231: Label: en
Ortho-unit polygons can be guarded with at most \(\left\lfloor \frac{n-4}{8} \right\rfloor\) guards: Label: en
Graphs with positive Ricci curvature: Label: en
Secant edges: a tool for Cohen et al.'s conjectures about subdivisions of oriented cycles and bispindles in Hamiltonian digraphs with large chromatic number: Label: en
Rainbow pancyclicity and panconnectivity of strongly edge-colored graphs: Label: en
Local degree conditions for Hamiltonicity of claw-free graphs: Label: en
Connectivity preserving Hamiltonian cycles in \(k\)-connected Dirac graphs: Label: en
On generalized Turán numbers of intersecting cliques: Label: en
The \(p\)-arboricity of outerplanar graphs: Label: en
On Fan's conjecture about 4-flow: Label: en
List dynamic 4-coloring of planar graphs: Label: en
Hamiltonian cycles and tight cutsets: Label: en
On the cut-vertex and the interval transit functions of hypergraphs: Label: en
Non-perfect \((P_5, C_5, K_5 -e)\)-free graphs are 5-colorable: Label: en
Dynamic cycles in edge-colored multigraphs: Label: en
Sufficient conditions make graphs edge DP-\(\varDelta\)-colorable: Label: en
Extremal graphs for Widom-Rowlinson colorings in \(k\)-chromatic graphs: Label: en
Ramsey numbers for multiple copies of hypergraphs: Label: en
Dimension bounds on classes of interval orders with restricted representation: Label: en
Note on polychromatic coloring of hereditary hypergraph families: Label: en
Several minimality concepts related to Frankl's conjecture: Label: en
Well-forced graphs: Label: en
A note on asymmetric hypergraphs: Label: en
Note on Mantel theorem and Turán theorem: Label: en
A note on non-isomorphic edge-color classes in random graphs: Label: en
Ramsey numbers of large books versus multipartite graphs: Label: en
A new construction for the planar Turán number of cycles: Label: en
Borodin-Kostochka's conjecture on \(\{P_2 \cup P_3, C_4\}\)-free graphs: Label: en
Characterization of \(P_3\cup P_2\)-equipackable graphs with \(3m\) \((m\geq 1)\) edges: Label: en
Maximizing the number of \(H\)-colorings of graphs with a fixed minimum degree: Label: en
Finding \(k\) shortest paths in Cayley graphs of finite groups: Label: en
The sparse sequences of graphs: Label: en
Perfect pseudo-matchings in cubic graphs: Label: en
On coloring parameters of triangle-free planar \((n, m)\)-graphs: Label: en
The bounds of rigid sphere design: Label: en
Gallai-Ramsey numbers for paths: Label: en
On extremal problems on multigraphs: Label: en
Maximum bisections of graphs with girth at least six: Label: en
Packing and covering triangles in bilaterally-complete tripartite graphs: Label: en
Burning Hamming graphs: Label: en
Rainbow solutions of a linear equation with coefficients in \(\mathbb{Z}/p\mathbb{Z}\): Label: en