Results 111 to 120 of about 2,126 (197)

Fractional colorings of partial t-trees with no large clique

Discrete Mathematics
9 ...
openaire   +2 more sources

(Treewidth, Clique)-Boundedness and Poly-logarithmic Tree-Independence

An {\em independent set} in a graph $G$ is a set of pairwise non-adjacent vertices. A {\em tree decomposition} of $G$ is a pair $(T, χ)$ where $T$ is a tree and $χ: V(T) \rightarrow 2^{V(G)}$ is a function satisfying the following two axioms: for every edge $uv \in V(G)$ there is a $x \in V(T)$ such that $\{u,v\} \subseteq χ(x)$, and for every vertex ...
Chudnovsky, Maria, S, Ajaykrishnan E, Lokshtanov, Daniel   +2 more
openaire   +2 more sources

Layered tree-independence number and clique-based separators

37 pages, 4 ...
Dallard, Clément, Milanič, Martin, Munaro, Andrea, Yang, Shizhou   +3 more
openaire   +2 more sources

Homophily within and across groups. [PDF]

Nat Commun
K Rizi A, Michielan R, Stegehuis C, Kivelä M.   +3 more
europepmc   +1 more source

Graphs that have clique (partial) 2-trees [PDF]

Journal of Combinatorics, 2012
openaire   +1 more source

Quadratic Kernel for Cliques or Trees Vertex Deletion

ISAAC ...
openaire   +3 more sources

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. [PDF]

Theory Comput Syst
Bentert M, Fomin FV, Golovach PA.
europepmc   +1 more source

A Clique-Based Separator for Intersection Graphs of Geodesic Disks in [Formula: see text]. [PDF]

Algorithmica
Aronov B, de Berg M, Theocharous L.
europepmc   +1 more source

Leveraging graphical model techniques to study evolution on phylogenetic networks. [PDF]

Philos Trans R Soc Lond B Biol Sci
Teo B, Bastide P, Ané C.
europepmc   +1 more source

Simplex polynomial in complex networks and its applications to compute the Euler characteristic. [PDF]

Front Comput Neurosci
Wang Z, Fu X, Deng B, Chen Y, Zhao H.
europepmc   +1 more source