Results 151 to 160 of about 332 (184)

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

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

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

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

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

Implications in rainbow forbidden subgraphs

Discrete Mathematics, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qing Cui, Qinghai Liu, Colton Magnant, Akira Saito   +3 more
openaire   +1 more source

Forbidden subgraphs on Hamiltonian index

Discrete Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xia Liu, Liming Xiong
openaire   +1 more source

Forbidden Subgraphs and 3-Colorings

SIAM Journal on Discrete Mathematics, 2014
A graph $G$ is said to satisfy the Vizing bound if $\chi(G)\le \omega(G)+1$, where $\chi(G)$ and $\omega(G)$ denote the chromatic number and clique number of $G$, respectively. The class of graphs satisfying the Vizing bound is clearly $\chi$-bounded in the sense of Gyarfas.
Genghua Fan, Baogang Xu, Tianjun Ye, Xingxing Yu   +3 more
openaire   +2 more sources

Forbidden induced subgraphs for toughness

J. Graph Theory, 2013
Summary: Let \(\mathcal F\) be a family of connected graphs. A graph \(G\) is said to be \(\mathcal F\)-free if \(G\) is \(H\)-free for every graph \(H\) in \(\mathcal F\). We study the relation between forbidden subgraphs in a connected graph \(G\) and the resulting toughness of \(G\). In particular, we consider the problem of characterizing the graph
Katsuhiro Ota, Gabriel Sueiro
openaire   +2 more sources

Forbidden subgraphs and graph decomposition

Networks, 1987
AbstractSeries‐parallel graphs, outerplanar graphs, and graphs whose polygon matroids are transversal have been characterized by forbidden subgraphs. Tutte introduced a graph decomposition for nonseparable graphs. The results of this paper relate the existence of the forbidden subgraphs to properties of the decomposition.
openaire   +3 more sources