Results 181 to 190 of about 523,591 (296)
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
On the structure of the sandpile identity element on Sierpiński gasket graphs. [PDF]
Comput Appl MathKaiser R, Sava-Huss E, Überbacher J.
europepmc +1 more source
The 1 3 $\frac{1}{3}$‐Conjectures for Domination in Cubic Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A set S $S$ of vertices in a graph G $G$ is a dominating set of G $G$ if every vertex not in S $S$ is adjacent to a vertex in S $S$. The domination number of G $G$, denoted by γ ( G ) $\gamma (G)$, is the minimum cardinality among all dominating sets in G $G$. In a breakthrough paper in 2008, Löwenstein and Rautenbach proved that if G $G$ is a
Paul Dorbec, Michael A. Henning
wiley +1 more source
Average-field approximation for dilute almost-bosonic anyons. [PDF]
Calc Var Partial Differ EquVisconti FLA.
europepmc +1 more source
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
Unstable Vortices, Sharp Non-Uniqueness with Forcing, and Global Smooth Solutions for the SQG Equation. [PDF]
Arch Ration Mech AnalCastro Á +3 more
europepmc +1 more source
Journal of Graph Theory, EarlyView.ABSTRACT Lovász et al. proved that every six‐edge‐connected graph has a nowhere‐zero three‐flow. In fact, they proved a more technical statement, which says that there exists a nowhere‐zero three‐flow that extends the flow prescribed on the incident edges of a single vertex z $z$ with bounded degree. We extend this theorem of Lovász et al.
Arnbjörg Soffía Árnadóttir +5 more
wiley +1 more source
Stability of Rayleigh-Jeans Equilibria in the Kinetic FPU Equation. [PDF]
Arch Ration Mech AnalGermain P, La J, Menegaki A.
europepmc +1 more source
From Finding a Spanning Subgraph H $H$ to an H $H$‐Factor
Journal of Graph Theory, EarlyView.ABSTRACT A typical Dirac‐type problem in extremal graph theory is to determine the minimum degree threshold for a graph G $G$ to have a spanning subgraph H $H$, for example, the Dirac theorem. A natural follow‐up problem is to seek an H $H$‐factor, which is a spanning set of vertex‐disjoint copies of H $H$.
Allan Lo
wiley +1 more source
A Structural Description of Zykov and Blanche Descartes Graphs
Journal of Graph Theory, EarlyView.ABSTRACT Around 1950, Zykov and Blanche Descartes proposed the two first explicit constructions of triangle‐free graphs with arbitrarily large chromatic number. We define a Zykov (resp. Blanche Descartes) graph as any induced subgraph of a graph created using Zykov's construction (resp. Blanche Descartes's).
Malory Marin +3 more
wiley +1 more source