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.

An efficient algorithm to compute the toughness in graphs with bounded treewidth: Label: en
The planar Turán number of \(\{K_4, C_5\}\) and \(\{K_4, C_6\}\): Label: en
On the complexity of local-equitable coloring in claw-free graphs with small degree: Label: en
New tools to study 1-11-representation of graphs: Label: en
The vertex arboricity of 1-planar graphs: Label: en
Independence number and maximal chromatic polynomials of connected graphs: Label: en
Ramsey numbers of multiple copies of graphs in a component: Label: en
Maximal colourings for graphs: Label: en
Normalized Laplacian eigenvalues of hypergraphs: Label: en
Gallai-Ramsey multiplicity for rainbow small trees: Label: en
On the sequence with fewer subsequence sums in finite abelian groups: Label: en
The robust chromatic number of graphs: Label: en
Using a Grassmann graph to recover the underlying projective geometry: Label: en
Covering array on the Cartesian product of hypergraphs: Label: en
Correction to: ``Harmonic index \(t\)-designs in the Hamming scheme for arbitrary \(q\): Label: en
Graphs \(G\) where \(G-N[v]\) is a tree for each vertex \(v\): Label: en
Some two-weight codes over chain rings and their strongly regular graphs: Label: en
Graphs with many independent vertex cuts: Label: en
The burning number conjecture is true for trees without degree-2 vertices: Label: en
The Eulerian distribution on the fixed-point free involutions of the hyperoctahedral group under the natural order: Label: en
Cliques of orders three and four in the Paley-type graphs: Label: en
Partitions of vertices and facets in trees and stacked simplicial complexes: Label: en
Pivot Gray codes for the spanning trees of a graph ft. the fan: Label: en
Injective chromatic index of \(K_4\)-minor free graphs: Label: en
A Dirac-type theorem for uniform hypergraphs: Label: en
The cordiality game and the game cordiality number: Label: en
Irreducible pairings and indecomposable tournaments: Label: en
A characterization of graphs with semitotal domination number one-third their order: Label: en
Recognizing \(\text{W}_2\) graphs: Label: en
Uniquely restricted matching extendable graphs: Label: en
An Alon-Tarsi style theorem for additive colorings: Label: en
Normalized Hodge Laplacian matrix and application to random walk on simplicial complexes: Label: en
Weak external bisections of regular graphs: Label: en
Almost intersecting families for vector spaces: Label: en
Closed-form solution of conic in point-line enumerative problem of conic: Label: en
Parameters of quotient-polynomial graphs: Label: en
Reduced clique graphs. A correction to: ``Chordal graphs and their clique graphs: Label: en
Semi-strict chordality of digraphs: Label: en
Computing the number and average size of connected sets in planar 3-trees: Label: en
On the Existence of Small Strictly Neumaier Graphs: Label: en
A Matrix for Counting Paths in Acyclic Colored Digraphs: Label: en
The primality graph of critical 3-hypergraphs: Label: en
On the Edge-Erdős–Pósa Property of Ladders: Label: en
Walk Domination and HHD-Free Graphs: Label: en
Path Saturation Game on Six Vertices: Label: en
Using Euler’s Formula to Find the Lower Bound of the Page Number: Label: en
Removable Edges in Claw-Free Bricks: Label: en
Tashkinov-trees: an annotated proof: Label: en
Turán numbers of several bipartite graphs: Label: en
Cographs and 1-sums: Label: en