Results 191 to 200 of about 1,408,918 (247)

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

The Phylogenetic Structure of β -diversity: Covariance Matrix Sparsification of Critical Beta-splitting Trees. [PDF]

Bull Math Biol
Svihla SP, Lladser ME.
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

A cortical semantic space integrating fractions and integers

Valério D, Debray S, Karami A, Cauté M, Gravel N, Dehaene S.   +5 more
europepmc   +1 more source

Wavelength-angle characterization of high-energy X-ray beams from lapped Si(111) double-crystal monochromators using rocking-curve tomography. [PDF]

J Synchrotron Radiat
Yamazaki H, Tahara K, Shimizu Y, Ohashi H.   +3 more
europepmc   +1 more source

Obstructions for Homomorphisms to Odd Cycles in Series‐Parallel Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT For a graph H $H$, an H $H$‐colouring of a graph G $G$ is a vertex mapping ϕ : V ( G ) → V ( H ) $\phi :V(G)\to V(H)$ such that adjacent vertices are mapped to adjacent vertices. A graph G $G$ is C 2 k + 1 ${C}_{2k+1}$‐critical if G $G$ has no C 2 k + 1 ${C}_{2k+1}$‐colouring but every proper subgraph of G $G$ has a C 2 k + 1 ${C}_{2k+1 ...
Eun‐Kyung Cho, Ilkyoo Choi, Boram Park, Mark Siggers   +3 more
wiley   +1 more source

Residue class biases in unrestricted partitions, partitions into distinct parts, and overpartitions. [PDF]

Res Math Sci
Schlosser MJ, Zhou NH.
europepmc   +1 more source

Characterization of Graphs Without Even F $F$‐Orientations

Journal of Graph Theory, EarlyView.
ABSTRACT A graph G $G$ is 1‐extendable if every edge belongs to at least one 1‐factor of G $G$. Let G $G$ be a graph with a 1‐factor F $F$. Then an even (odd) F $F$ ‐orientation of G $G$ is an orientation in which each F $F$‐alternating cycle has exactly an even (odd) number of edges directed in the same fixed direction around the cycle.
Marién Abreu, Domenico Labbate, Federico Romaniello, John Sheehan   +3 more
wiley   +1 more source

The Variance-Gamma Product Distribution. [PDF]

Results Math
Gaunt RE, Li S, Sutcliffe HL.
europepmc   +1 more source

Two‐Block Paths in Oriented Graphs of Large Semidegree

Journal of Graph Theory, EarlyView.
ABSTRACT We study the existence of oriented paths with two blocks in oriented graphs under semidegree conditions. A block of an oriented path is a maximal directed subpath. Given positive integers k $k$ and ℓ $\ell $ with k / 2 ≤ ℓ < k $k/2\le \ell \lt k$, we establish a semidegree function that guarantees the containment of every oriented path with ...
Irena Penev, S Taruni, Stéphan Thomassé, Ana Trujillo‐Negrete, Mykhaylo Tyomkyn   +4 more
wiley   +1 more source