Results 241 to 250 of about 187,749 (326)

Decomposable and Essentially Univariate Mass-Action Systems: Extensions of the Deficiency One Theorem. [PDF]

J Nonlinear Sci
Deshpande A, Müller S.
europepmc   +1 more source

On an extremal problem in graph theory

, 1970
P. Erdös
semanticscholar   +1 more source

Chromatic Ramsey Numbers and Two‐Color Turán Densities

Journal of Graph Theory, EarlyView.
ABSTRACT Given a graph G, its 2‐color Turán number ex ( 2 ) ( n , G ) is the maximum number of edges in an n‐vertex graph, such that the edges can be colored with two colors avoiding a monochromatic copy of G. Let π ( 2 ) ( G ) = lim n → ∞ ex ( 2 ) ( n , G ) / n 2 be the 2‐color Turán density of G.
Maria Axenovich, Simon Gaa, Dingyuan Liu
wiley   +1 more source

QSPR analysis of anticancer drugs using the Euler-Sombor index and theoretical insights on its minimum value for unicyclic graphs. [PDF]

Sci Rep
Shetty S, Rakshith BR, Udupa NVS.
europepmc   +1 more source

Tree Independence Number III. Thetas, Prisms and Stars

Journal of Graph Theory, EarlyView.
ABSTRACT We prove that for every t ∈ N $t\in {\mathbb{N}}$ there exists τ = τ ( t ) ∈ N $\tau =\tau (t)\in {\mathbb{N}}$ such that every (theta, prism, K 1 , t ${K}_{1,t}$)‐free graph has tree independence number at most τ $\tau $ (where we allow “prisms” to have one path of length zero).
Maria Chudnovsky, Sepehr Hajebi, Nicolas Trotignon   +2 more
wiley   +1 more source

The Firefighter problem with dynamic defence costs. [PDF]

PLoS One
Hunter E, Enright J.
europepmc   +1 more source

On Odd Covers of Cliques and Disjoint Unions

Journal of Graph Theory, EarlyView.
ABSTRACT Babai and Frankl posed the “odd cover problem” of finding the minimum cardinality of a collection of complete bipartite graphs such that every edge of the complete graph of order n $n$ is covered an odd number of times. In a previous paper with O'Neill, some of the authors proved that this value is always ⌈ n / 2 ⌉ $\lceil n/2\rceil $ or ⌈ n /
Calum Buchanan, Alexander Clifton, Eric Culver, Péter Frankl, Jiaxi Nie, Kenta Ozeki, Puck Rombach, Mei Yin   +7 more
wiley   +1 more source

Explicit 3‐colorings for Exponential Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT In 1985, El‐Zahar and Sauer showed that the chromatic number of the direct product of two 4‐chromatic graphs is 4, establishing a nontrivial case of Hedetniemi's conjecture, which has since been refuted in general. Their proof uses the concept of an exponential graph, showing that if a graph H $H$ has no proper 3‐coloring, then the exponential
Adrien Argento, Pierre Charbit, Alantha Newman   +2 more
wiley   +1 more source

Orientability of undirected phylogenetic networks to a desired class: practical algorithms and application to tree-child orientation. [PDF]

Algorithms Mol Biol
Urata T, Yokoyama M, Miyaji H, Hayamizu M.   +3 more
europepmc   +1 more source

Sparse Graphs With Local Covering Conditions on Edges

Journal of Graph Theory, EarlyView.
ABSTRACT In 1988, Erdős suggested the question of minimizing the number of edges in a connected n $n$‐vertex graph where every edge is contained in a triangle. Shortly after, Catlin, Grossman, Hobbs, and Lai resolved this in a stronger form. In this paper, we study a natural generalization of the question of Erdős in which we replace “triangle” with ...
Debsoumya Chakraborti, Amirali Madani, Anil Maheshwari, Babak Miraftab   +3 more
wiley   +1 more source