Results 161 to 170 of about 8,902 (235)
A fuzzy graph theoretic approach to face shape recognition using cubic outerplanar structures. [PDF]
Sci RepJaisankar D, Ramalingam S, Zegeye GB.
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 +2 more
wiley +1 more source
Extension of partial atom-to-atom maps: uniqueness and algorithms. [PDF]
Algorithms Mol BiolLaffitte MEG, Phan TL, Stadler PF.
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 +7 more
wiley +1 more source
Peierls Bounds from Toom Contours. [PDF]
J Theor ProbabSwart JM, Szabó R, Toninelli C.
europepmc +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 +2 more
wiley +1 more source
Cover-free families on hypergraphs and combinatorial group testing. [PDF]
J Comb OptimIdalino TB, Moura L.
europepmc +1 more source
Flexible List Coloring of Graphs With Maximum Average Degree Less Than 3
Journal of Graph Theory, EarlyView.ABSTRACT In the flexible list coloring problem, we consider a graph G $G$ and a color list assignment L $L$ on G $G$, as well as a subset U ⊆ V ( G ) $U\subseteq V(G)$ for which each u ∈ U $u\in U$ has a preferred color p ( u ) ∈ L ( u ) $p(u)\in L(u)$. Our goal is to find a proper L $L$‐coloring ϕ $\phi $ of G $G$ such that ϕ ( u ) = p ( u ) $\phi (u)=
Richard Bi, Peter Bradshaw
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 RepShetty S, Rakshith BR, Udupa NVS.
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 +3 more
wiley +1 more source