Results 211 to 220 of about 9,658 (272)

Upper Bounds on the Minimum Size of Feedback Arc Set of Directed Multigraphs With Bounded Degree

Journal of Graph Theory, EarlyView.
ABSTRACT An oriented multigraph is a directed multigraph without directed 2‐cycles. Let fas ( D ) $\text{fas}(D)$ denote the minimum size of a feedback arc set in an oriented multigraph D $D$. In several papers, upper bounds for fas ( D ) $\text{fas}(D)$ were obtained for oriented multigraphs D $D$ with maximum degree upper‐bounded by a constant ...
Gregory Gutin, Hui Lei, Anders Yeo, Yacong Zhou   +3 more
wiley   +1 more source

Free Boundary Hamiltonian Stationary Lagrangian Discs in C 2. [PDF]

J Geom Anal
Gaia F.
europepmc   +1 more source

On Oriented Colourings of Graphs on Surfaces

Journal of Graph Theory, EarlyView.
ABSTRACT For an oriented graph G $G$, the least number of colours required to oriented colour G $G$ is called the oriented chromatic number of G $G$ and denoted χ o ( G ) ${\chi }_{o}(G)$. For a non‐negative integer g $g$ let χ o ( g ) ${\chi }_{o}(g)$ be the least integer such that χ o ( G ) ≤ χ o ( g ) ${\chi }_{o}(G)\le \unicode{x0200A}{\chi }_{o}(g)
Alexander Clow
wiley   +1 more source

Realizing Shor's algorithm with topological acoustic phase bits. [PDF]

Commun Eng
Kuk I, Djordjevic IB, Runge K, Gabitov IR, Deymier PA.   +4 more
europepmc   +1 more source

Edge‐Length Preserving Embeddings of Graphs Between Normed Spaces

Journal of Graph Theory, EarlyView.
ABSTRACT The concept of graph embeddability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces into a given normed space. A finite simple graph G = ( V , E ) $G=(V,E)$ is said to be ( X , Y ) $(X,Y)$‐embeddable if any set of induced edge lengths from an ...
Sean Dewar, Eleftherios Kastis, Derek Kitson, William Sims   +3 more
wiley   +1 more source

Electric-Current-Assisted Nucleation of Zero-Field Hopfion Rings. [PDF]

Adv Mater
Chen X, Song D, Rybakov FN, Kiselev NS, Li L, Shi W, Wu R, Fu X, Eriksson O, Blügel S, Dunin-Borkowski RE, Du H, Zheng F.   +12 more
europepmc   +1 more source

Fractional Balanced Chromatic Number and Arboricity of Planar (Signed) Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT A balanced ( p , q ) $(p,q)$‐coloring of a signed graph ( G , σ ) $(G,\sigma )$ is an assignment of q $q$ colors to each vertex of G $G$ from a platter of p $p$ colors, such that each color class induces a balanced set (a set that does not induce a negative cycle).
Reza Naserasr, Lan Anh Pham, Cyril Pujol, Huan Zhou   +3 more
wiley   +1 more source

Ramanujan's partition generating functions modulo ℓ. [PDF]

Ramanujan J
Bringmann K, Craig W, Ono K.
europepmc   +1 more source

From Awareness to Action: Are Dental Professionals Ready to Respond to Intimate Partner Violence? An Innovative Training Approach

Journal of Dental Education, EarlyView.
Sepideh Banava, Barbara Clyburn, Mona Abdelrehim, Shakiba Ghasemi Assl, Sonica Singhal   +4 more
wiley   +1 more source

Fractional List Packing for Layered Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
wiley   +1 more source