Results 161 to 170 of about 2,319,892 (295)

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

Resonance transformations for the ( 2 , 2 p + 1 ) minimal string via x - y swap: a proof of Artemev's conjecture. [PDF]

Lett Math Phys
Dekinga K, Shadrin S, Verlinde E.
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

Rescaling and Asymptotic Acceleration in Unconstrained Quadratic Optimisation. [PDF]

Mathematica (N Y)
Zverovich A, Hutchings M, Gauthier B.
europepmc   +1 more source

On Graphs Which Have Locally Complete 2‐Edge‐colourings and Their Relationship to Proper Circular‐Arc Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT A 2‐edge‐coloured graph G $G$ is called locally complete if for each vertex v $v$, the vertices adjacent to v $v$ through edges of the same colour induce a complete subgraph in G $G$. Locally complete 2‐edge‐coloured graphs have nice properties, and there exists a polynomial algorithm to decide whether such a graph has an alternating ...
Jørgen Bang‐Jensen, Jing Huang
wiley   +1 more source

Exact sequence interpolation with transformers. [PDF]

Math Found Mach Learn
Alcalde A, Fantuzzi G, Zuazua E.
europepmc   +1 more source

Materiali a cambiamento di fase per l'incremento dell'inerzia termica nelle costruzioni leggere

, 2001
Napoli ...
LEMMA, Massimo
core  

The Minimal Nonplanar Strong Digraphs

Journal of Graph Theory, EarlyView.
ABSTRACT Kuratowski's theorem says that the minimal (under subgraph containment) graphs that are not planar are the subdivisions of K 5 ${K}_{5}$ and of K 3 , 3 ${K}_{3,3}$. Here we study the minimal (under subdigraph containment) strongly‐connected digraphs that are not planar.
Stephen Bartell, Paul Seymour
wiley   +1 more source

The SLO Hierarchy of Pseudo-Boolean Functions and Runtime of Evolutionary Algorithms. [PDF]

Algorithmica
Dang DC, Lehre PK.
europepmc   +1 more source

Perspectives of High‐Resolution Mass Spectrometry in Soil Science

Journal of Plant Nutrition and Soil Science, EarlyView.
ABSTRACT Soil biogeochemical research requires specific, sensitive, and accurate methods to identify and quantify organic molecules in order to trace biochemical processes and assess element cycling in complex, heterogenous systems. High‐resolution mass spectrometry (HRMS) has evolved into a transformative tool for unraveling the complex chemical ...
Bruno Glaser, Tobias Bromm, Klaus Kaiser, Arthur Gross, Carsten Simon, Snežana Maletić, Ines Mulder, Oliver J. Lechtenfeld, Sören Thiele‐Bruhn, Ivy Notterpek, Callum Banfield, Michaela A. Dippold   +11 more
wiley   +1 more source