Results 211 to 220 of about 791,112 (289)

nVenn2: faster, simpler generalized quasi-proportional Venn diagrams. [PDF]

Bioinform Adv
Pis-Vigil S, González-Pereira M, Hamczyk MR, Quesada V.   +3 more
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

Comparison of Different Methods for the Meta-Analysis of Diagnostic Test Accuracy Studies-A Simulation Study. [PDF]

Biom J
Stoye FV, Raths O, Hapfelmeier A, Fomenko A, Kuss O, Hoyer A.   +5 more
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, Pierre Charbit, Alantha Newman   +2 more
wiley   +1 more source

Delayed heart rate recovery and its variability in fitness functional training compared to endurance athletes: a cross-sectional analysis. [PDF]

PeerJ
Guimarães FER, Morlin MT, Barreto KA, Porto LGG, Molina GE.   +4 more
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

A new family of <i>q</i>-hypergeometric congruences from Andrews' multi-series transformation. [PDF]

Rev R Acad Cienc Exactas Fis Nat A Mat
Guo VJW, Schlosser MJ.
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

Noncyclic BCH and Srivastava codes over the subgroup of the groups of units of Galois rings [Formula: see text] for advanced error control. [PDF]

Sci Rep
Sajjad M, Bashir Q, Haleemzai I, Abdalrahem MK, Hazzazi MM.   +4 more
europepmc   +1 more source

Path Degeneracy and Applications

Journal of Graph Theory, EarlyView.
ABSTRACT In this work, we relate girth and path‐degeneracy in classes with sub‐exponential expansion, with explicit bounds for classes with polynomial expansion and proper minor‐closed classes that are tight up to a constant factor (and tight up to second order terms if a classical conjecture on existence of g $g$‐cages is verified). As an application,
Yuquan Lin, Patrice Ossona de Mendez
wiley   +1 more source