Results 171 to 180 of about 69,865 (208)

Realizing string-net condensation: Fibonacci anyon braiding for universal gates and sampling chromatic polynomials. [PDF]

Nat Commun
Minev ZK, Najafi K, Majumder S, Wang J, Stern A, Kim EA, Jian CM, Zhu G.   +7 more
europepmc   +1 more source

On Some Non-Rigid Unit Distance Patterns. [PDF]

Discrete Comput Geom
Frankl N, Woodruff D.
europepmc   +1 more source

Compression theory for inhomogeneous systems. [PDF]

Nat Commun
Gökmen DE, Biswas S, Huber SD, Ringel Z, Flicker F, Koch-Janusz M.   +5 more
europepmc   +1 more source

Beyond text: Using network centralities and AI models to detect suicide risk on Reddit. [PDF]

Int J Clin Health Psychol
Nikmehr G, Bilbao-Jayo A, Almeida A.
europepmc   +1 more source

Transitivity, contextuality and decision making. [PDF]

Philos Trans A Math Phys Eng Sci
Sulis WH.
europepmc   +1 more source

The forbidden subgraph characterization of directed vertex graphs [PDF]

Discrete Mathematics, 1999
A graph is called a directed vertex (DV) graph if it is the intersection graph of a family of directed paths in a directed tree, i.e., a tree in which each edge is oriented, with one or more vertices of indegree zero.
B S Panda
exaly   +2 more sources

A forbidden subgraph characterization of line-polar bipartite graphs [PDF]

Discrete Applied Mathematics, 2010
A graph is polar if the vertex set can be partitioned into A and B in such a way that the subgraph induced by A is a complete multipartite graph and the subgraph induced by B is a disjoint union of cliques.
Baogang Xu, Jing Huang
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Forbidden subgraphs and forbidden substructures

Journal of Symbolic Logic, 2001
AbstractThe problem of the existence of a universal structure omitting a finite set of forbidden substructures is reducible to the corresponding problem in the category of graphs with a vertex coloring by two colors. It is not known whether this problem reduces further to the category of ordinary graphs.
Gregory L. Cherlin, Niandong Shi
openaire   +2 more sources

Forbidden ordered subgraph vs. forbidden subgraph characterizations of graph classes

Journal of Graph Theory, 1999
Given an ordered graph \((G,
exaly   +4 more sources