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.

Antimagic labeling for subdivisions of graphs: Label: en
Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes: Label: en
Monochromatic graph decompositions inspired by anti-Ramsey colorings: Label: en
Maximum locally irregular induced subgraphs via minimum irregulators: Label: en
The degree sequence of the preferential attachment model: Label: en
Computing the matching and independence polynomials of double hexagonal chains: Label: en
A note on stability results for Berge-\( K_{s , t}\) hypergraphs: Label: en
The \(\varepsilon\)-spectral radius of trees with perfect matchings: Label: en
Spanning trees of bipartite graphs with a bounded number of leaves and branch vertices: Label: en
Upper bounds and approximation results for the \(k\)-slow burning problem: Label: en
List recoloring of planar graphs: Label: en
The clique number of the exact distance \(t\)-power graph: complexity and eigenvalue bounds: Label: en
Games restricted by simplicial complexes and an application to vertiport cooperation: Label: en
Computing the minimal perimeter polygon for digital objects in the triangular tiling: Label: en
Small matchings extend to Hamiltonian cycles in hypercubes with disjoint faulty edges: Label: en
Twin-width of graphs with tree-structured decompositions: Label: en
On the potential function \(\sigma ( H , m , n )\) of an arbitrary bipartite graph \(H\): Label: en
Subnetwork reliability analysis of star networks: Label: en
More on the complexity of defensive domination in graphs: Label: en
Turán problem of signed graph for negative odd cycle: Label: en
Cyclic base ordering of certain degenerate graphs: Label: en
A note on universal graphs for spanning trees: Label: en
Ramsey and Gallai-Ramsey numbers for comb and sun graphs: Label: en
A new condition on dominated pair degree sum for a digraph to be supereulerian: Label: en
Bounds for eccentricity-based parameters of graphs: Label: en
Resistance distance in generalized core-satellite graphs: Label: en
Renting servers in the cloud: the case of equal duration jobs: Label: en
A computational study on integer programming formulations for hop-constrained survivable network design: Label: en
Characterization of graphs with the limited normalized algebraic connectivity: Label: en
Upper bounds for some graph invariants in terms of blocks and cut-vertices: Label: en
Query complexity of Boolean functions on the middle slice of the cube: Label: en
Proper conflict-free coloring of sparse graphs: Label: en
Resistance distances in generalized join graphs: Label: en
Minimal trees with respect to exponential Zagreb indices: Label: en
Partitions of \(\mathbb{Z} m\) with identical representation functions: Label: en
Rainbow short linear forests in edge-colored complete graph: Label: en
Complexity of maker-breaker games on edge sets of graphs: Label: en
On the minimum spectral radius of graphs with given order and dissociation number: Label: en
Multiplicity of signless Laplacian eigenvalue 2 of a connected graph with a perfect matching: Label: en
Neighbor sum distinguishing total choosability of planar graphs without intersecting 4-cycles: Label: en
On vertices of outdegree \(k\) in minimally \(k\)-arc-connected digraphs: Label: en
Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs: Label: en
Packing 2- and 3-stars into \(( 2 , 3 )\)-regular graphs: Label: en
On enumerating short projected models: Label: en
Star-factors with large components, fractional \(k\)-extendability and spectral radius in graphs: Label: en
Recoloring some hereditary graph classes: Label: en
Rigidity of symmetric linearly constrained frameworks in the plane: Label: en
New theoretical results on the monotone Boolean duality and the monotone Boolean dualization problems: Label: en
On the pebbling numbers of flower, Blanuša and Watkins snarks: Label: en
The \(\alpha \)-index of graphs without intersecting triangles/quadrangles as a minor: Label: en