Results 181 to 190 of about 5,978,611 (274)

One Part Leaky Covers. [PDF]

Mathematica (N Y)
Cavalieri R, Markwig H, Schmitt J.
europepmc   +1 more source

On Sparsity Conditions Guaranteeing a Fractional Coloring

Journal of Graph Theory, EarlyView.
ABSTRACT A graph has an ( a : b ) $(a:b)$ ‐coloring if there exists an assignment from the vertices to subsets of { 1 , … , a } $\{1,\ldots ,a\}$ with size b $b$ such that adjacent vertices are assigned disjoint subsets. Odd girth at least 2 k + 1 $2k+1$ is a necessary condition for a graph to have a ( 2 k + 1 : k ) $(2k+1:k)$‐coloring.
Ilkyoo Choi
wiley   +1 more source

Methods for Analyzing RNA Pseudoknots via Chord Diagrams and Intersection Graphs. [PDF]

Bull Math Biol
Ibrahim R, Moore AH.
europepmc   +1 more source

Beyond the Vertex: A Contemporary Review of Graph Theory

International Journal of Computer Applications
openaire   +1 more source

Saturated Partial Embeddings of Planar Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT In this work, we study how far one can deviate from optimal behavior when embedding a planar graph. For a planar graph G $G$, we say that a plane subgraph H ⊆ G $H\subseteq G$ is a plane‐saturated subgraph if adding any edge (possibly with new vertices) to H $H$ would either violate planarity or make the resulting graph no longer a subgraph of
Alexander Clifton, Nika Salia
wiley   +1 more source

Hyperadaptability Through Self-Organizing Behavioral Search. [PDF]

Entropy (Basel)
Baranski A, Tani J.
europepmc   +1 more source

A Note on Extendable Sets of Colorings and Rooted Minors

Journal of Graph Theory, EarlyView.
ABSTRACT DeVos and Seymour proved that for every set C $C$ of 3‐colorings of a set X $X$ of vertices, there exists a plane graph G $G$ with vertices of X $X$ incident with the outer face such that a 3‐coloring of X $X$ extends to a 3‐coloring of G $G$ if and only if it belongs to C $C$.
Zdeněk Dvořák, Jan M. Swart
wiley   +1 more source

Globalization of Perturbative Chern-Simons Theory on the Moduli Space of Flat Connections in the BV Formalism. [PDF]

Commun Math Phys
Mnev P, Wernli K.
europepmc   +1 more source

Equivalent Formulation of Thomassen's Conjecture Using Tutte Paths in Claw‐Free Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT We continue studying Thomassen's conjecture (every 4‐connected line graph has a Hamilton cycle) in the direction of a recently shown equivalence with Jackson's conjecture (every 2‐connected claw‐free graph has a Tutte cycle), and we extend the equivalent formulation as follows: In every connected claw‐free graph, any two vertices are connected
Adam Kabela, Zdeněk Ryjáček, Petr Vrána   +2 more
wiley   +1 more source

Exploring anticancer drug structures through vertex based resolving parameters. [PDF]

Sci Rep
Chaudhry F, Hussain M, Hanif MF, Alzahrani AK, Fiidow OA.   +4 more
europepmc   +1 more source