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 #51 to #100.

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
Extremal spectral radius of degree-based weighted adjacency matrices of graphs with given order and size: Label: en
The phylogeny number of a graph in the aspect of its triangles and diamonds: Label: en
Coulson-type integral formulas for the general (skew) Estrada index of a vertex: Label: en
Efficient enumeration of transversal edge-partitions: Label: en
Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints: Label: en
Intersection of chordal graphs and some related partition problems: Label: en
Quasi-kernels in split graphs: Label: en
Pure Nash equilibria in weighted matroid congestion games with non-additive aggregation and beyond: Label: en
Self-adhesivity in lattices of abstract conditional independence models: Label: en
Distance Laplacian spectra of graphs: a survey: Label: en
An improved bound for 2-distance coloring of planar graphs with girth six: Label: en
Computing the expected value of invariants based on resistance distance for random spiro-polynomio chains: Label: en
Serial exchanges in random bases: Label: en
Well-indumatched pseudoforests: Label: en
Exact vertex forwarding index of the strong product of complete graph and cycle: Label: en
Approximation algorithm of maximizing non-submodular functions under non-submodular constraint: Label: en
Toughness and distance spectral radius in graphs involving minimum degree: Label: en
Independence, matching and packing coloring of the iterated Mycielskian of graphs: Label: en
Maximum energy bicyclic graphs containing two odd cycles with one common vertex: Label: en
On the eccentric connectivity index of trees with given domination number: Label: en
On the chromatic number of powers of subdivisions of graphs: Label: en
Induced Turán problem in bipartite graphs: Label: en
Re-1-embeddings of optimal 1-embedded graphs on the projective plane: Label: en
Fast enumeration of all cost-bounded solutions for combinatorial problems using ZDDs: Label: en
On extremal values of some degree-based topological indices with a forbidden or a prescribed subgraph: Label: en
Hamiltonian cycles avoiding prescribed arcs in semicomplete digraphs: Label: en
Polynomial delay hybrid algorithms to enumerate candidate keys for a relation: Label: en
Arbitrarily edge-partitionable graphs: Label: en
Minimum maximal acyclic matching in proper interval graphs: Label: en