Results 51 to 60 of about 215 (116)

Vertex colouring and forbidden subgraphs - a survey [PDF]

, 2004
There is a great variety of colouring concepts and results in the literature. Here our focus is to survey results on vertex colourings of graphs defined in terms of forbidden induced subgraph ...
Randerath, Bert, Schiermeyer, Ingo
core  

Time‐Series RNA‐Seq of Acropora tenuis Reveals Molecular Waves Leading to Synchronous Mass Spawning of Scleractinian Corals

Molecular Ecology, Volume 34, Issue 21, November 2025.
ABSTRACT Although mass, synchronised spawning of scleractinian corals is a well‐known phenomenon, its underlying molecular mechanisms, especially those that achieve synchronous release of gametes, are still unknown. In the genus Acropora, the dominant scleractinian coral in shallow reefs, spawning timing is synchronised in any given location, but often
Yuki Yoshioka, Go Suzuki, Yuji Fujikura, Satokuni Tashiro, Taiga Uchida, Eiichi Shoguchi, Noriyuki Satoh, Chuya Shinzato   +7 more
wiley   +1 more source

Measures of Subclinical Psychopathy and Everyday Sadism are Still Redundant: A Conceptual Replication and Extension of Blötner and Mokros (2023)

Journal of Personality, Volume 93, Issue 5, Page 1125-1138, October 2025.
ABSTRACT Objective Various psychological concepts with different names reflect essentially the same content. A recent study (https://doi.org/10.1016/j.paid.2023.112102) found short scales of subclinical psychopathy and everyday sadism to be affected by this so‐called jangle fallacy: Latent factors of psychopathy and everyday sadism were almost ...
Christian Blötner, Sandy S. Spormann, Miriam J. Hofmann, Andreas Mokros   +3 more
wiley   +1 more source

Tight bounds for intersection‐reverse sequences, edge‐ordered graphs, and applications

Journal of the London Mathematical Society, Volume 112, Issue 4, October 2025.
Abstract In 2006, Marcus and Tardos proved that if A1,⋯,An$A^1,\dots,A^n$ are cyclic orders on some subsets of a set of n$n$ symbols such that the common elements of any two distinct orders Ai$A^i$ and Aj$A^j$ appear in reversed cyclic order in Ai$A^i$ and Aj$A^j$, then ∑i|Ai|=O(n3/2logn)$\sum _{i} |A^i|=O(n^{3/2}\log n)$.
Barnabás Janzer, Oliver Janzer, Abhishek Methuku, Gábor Tardos   +3 more
wiley   +1 more source

Relations Between Psychological Capital, Personal Well‐Being, and Feelings of Stress and Anxiety Among Employed and Unemployed Evacuees

Risk, Hazards &Crisis in Public Policy, Volume 16, Issue 3, September 2025.
ABSTRACT The study investigated relations between psychological capital (PsyCap), personal well‐being, and feelings of stress and anxiety among evacuees from northern Israel during the Iron Swords war, examining differences between employed and non‐employed evacuees. A sample of 126 participants was divided into two subsamples: employed and unemployed.
Batel Hazan‐Liran, Nirit Karni‐Vizer
wiley   +1 more source

Vizing's conjecture for cographs

, 2016
We show that if $G$ is a cograph, that is $P_4$-free, then for any graph $H$, $ (G\square H)\geq (G) (H)$. By the characterization of cographs as a finite sequence of unions and joins of $K_1$, this result easily follows from that of Bartsalkin and German. However, the techniques used are new and may be useful to prove other results.
openaire   +2 more sources

A new bound for Vizing's conjecture

, 2016
For any graph $G$, we define the power $π(G)$ as the minimum of the largest number of neighbors in a $γ$-set of $G$, of any vertex, taken over all $γ$-sets of $G$. We show that $γ(G\square H)\geq \frac{π(G)}{2π(G) -1}γ(G)γ(H)$. Our methods allow us to prove the following statements for any graphs $G$ and $H$, (1) $γ(G\square H)\geq \frac{\lceil \frac{γ(
Krop, Elliot, Wolff, Kimber
openaire   +2 more sources

Aspects of Unstructured Grids and Finite-Volume Solvers for the Euler and Navier-Stokes Equations [PDF]

, 1992
One of the major achievements in engineering science has been the development of computer algorithms for solving nonlinear differential equations such as the Navier-Stokes equations.
Barth, Timothy J.
core   +1 more source

Approximate path decompositions of regular graphs

Journal of the London Mathematical Society, Volume 112, Issue 2, August 2025.
Abstract We show that the edges of any d$d$‐regular graph can be almost decomposed into paths of length roughly d$d$, giving an approximate solution to a problem of Kotzig from 1957. Along the way, we show that almost all of the vertices of a d$d$‐regular graph can be partitioned into n/(d+1)$n/(d+1)$ paths, asymptotically confirming a conjecture of ...
Richard Montgomery, Alp Müyesser, Alexey Pokrovskiy, Benny Sudakov   +3 more
wiley   +1 more source

Towards better understanding of factors contributing to medical physicist well‐being in academic medical centers: A systems‐analysis approach

Journal of Applied Clinical Medical Physics, Volume 26, Issue 6, June 2025.
Abstract The well‐being of medical physicists can impact overall system performance, patient safety, and quality of patient care. There are limited formal assessments of factors contributing to physicists well‐being. Nine medical physicists at a US academic medical center were surveyed on 21 workplace factors, drawn from the National Academy of ...
Elizabeth Kwong, Chao Chin Liu, Karthik Adapa, Lisa Vizer, Brian Anderson, Damian McHugh, Todd Pawlicki, Moyed Miften, Amit Sawant, Nadia Charguia, Shiva Das, Lawrence B. Marks, Jean L. Wright, Lukasz Mazur   +13 more
wiley   +1 more source