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.

Ramsey Numbers for Connected 2-Colorings of Complete Graphs: Label: en
Bounds for the augmented Zagreb index: Label: en
New Diagonal Graph Ramsey Numbers of Unicyclic Graphs: Label: en
TS-Reconfiguration of $k$-Path Vertex Covers in Caterpillars for $k \geq 4$: Label: en
Difference of Facial Achromatic Numbers between Two Triangular Embeddings of a Graph: Label: en
The Ricci Curvature on Simplicial Complexes: Label: en
Toughness of Recursively Partitionable Graphs: Label: en
Wiener index in graphs given girth, minimum, and maximum degrees: Label: en
On the hardness of the Balanced Connected Subgraph Problem for families of Regular Graphs: Label: en
On Nowhere Zero 4-Flows in Regular Matroids: Label: en
Optimal orientations of Vertex-multiplications of Trees with Diameter 4: Label: en
Outer Independent Double Italian Domination of Some Graph Products: Label: en
Counting Power Domination Sets in Complete m-ary Trees: Label: en
HS-integral and Eisenstein integral mixed circulant graphs: Label: en
Fractional matching preclusion for butterfly derived networks: Label: en
On the Planarity of Generalized Line Graphs: Label: en
Singular Ramsey and Turán numbers: Label: en
Subsets of vertices of the same size and the same maximum distance: Label: en
Finite Simple Graphs and Their Associated Graph Lattices: Label: en
Reducing the maximum degree of a graph by deleting vertices: the extremal cases: Label: en
Minimal Graphs with a Specified Code Map Image: Label: en
Integer-antimagic spectra of disjoint unions of cycles: Label: en
An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences: Label: en
Finite Asymptomatic Clusters of Metric Spaces: Label: en
$\gamma'$-Realizability and Other Musings on Inverse Domination: Label: en
A General Lower Bound on Gallai-Ramsey Numbers for Non-Bipartite Graphs: Label: en
Policy-Preferred Paths in AS-level Internet Topology Graphs: Label: en
Traveling in Networks with Blinking Nodes: Label: en
Generalized Matching Preclusion in Bipartite Graphs: Label: en
Edge Colorings of Complete Multipartite Graphs Forbidding Rainbow Cycles: Label: en
Application of an Extremal Result of Erdős and Gallai to the (n,k,t) Problem: Label: en
Note On 6-regular Graphs On The Klein Bottle: Label: en
Two short proofs of the Perfect Forest Theorem: Label: en
On the Graceful Cartesian Product of Alpha-Trees: Label: en
Classifying Resolving Lists by Distances between Members: Label: en
Group-antimagic Labelings of Multi-cyclic Graphs: Label: en
Path-factors involving paths of order seven and nine: Label: en
A Class of Graphs Approaching Vizing's Conjecture: Label: en
Eternal Independent Sets in Graphs: Label: en
An Extremal Problem for Finite Lattices: Label: en
An edge-swap heuristic for finding dense spanning trees: Label: en
Connection and separation in hypergraphs: Label: en
Path-tables of trees: a survey and some new results: Label: en
Scheduling N Burgers for a k-Burger Grill: Chromatic Numbers With Restrictions: Label: en
Dynamic approach to k-forcing: Label: en
Bounds for the Zero Forcing Number of Graphs with Large Girth: Label: en
Second Hamiltonian cycles in claw-free graphs: Label: en
An Isomorphism Problem in Z^2: Label: en
Note on rainbow connection in oriented graphs with diameter 2: Label: en
Hamiltonicity and $\sigma$-hypergraphs: Label: en