Results 171 to 180 of about 1,804,356 (287)

Way More than the Sum of Their Parts: From Statistical to Structural Mixtures. [PDF]

Entropy (Basel)
Crutchfield JP.
europepmc   +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

Steering of Crystal Cell Volumes in Apatites and Bioapatites. [PDF]

Molecules
Kuczumow A, Lasota A, Gorzelak M, Wojtyła-Buciora P, Biliński P, Bernatek M, Turżańska K, Olszewski J, Dyndor P, Jarzębski M, Wieruszewski M, Jabłoński M.   +11 more
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

Serendipity discrete complexes with enhanced regularity. [PDF]

Calcolo
Di Pietro DA, Hanot M, Salah M, Salah M.
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

Electroplating Composite Coatings of Nickel with Dispersed WO₃ and MoO₃ on Al Substrate to Increase Wear Resistance. [PDF]

Materials (Basel)
Osipov P, Shayakhmetova R, Murzalinov D, Sagyndykov A, Kali A, Mukhametzhanova A, Maldybayev G, Mit K.   +7 more
europepmc   +1 more source

A Note on Lovász Characterization of Perfect Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT A graph is perfect if, for every induced subgraph, the chromatic number equals the size of its largest clique. In 1972, Lovász established a fundamental characterization of perfect graphs, showing that a graph is perfect if and only if, for every induced subgraph, the product of the size of the largest independent set and the size of the ...
James Alex
wiley   +1 more source

Counting Subnetworks Under Gene Duplication in Genetic Regulatory Networks. [PDF]

Bull Math Biol
Scruse A, Arnold J, Robinson R.
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