Results 121 to 130 of about 1,354,678 (274)

Harmonious coloring of uniform hypergraphs

open access: yesApplicable Analysis and Discrete Mathematics, 2016
A harmonious coloring of a k-uniform hypergraph H is a vertex coloring such that no two vertices in the same edge share the same color, and each k-element subset of colors appears on at most one edge. The harmonious number h(H) is the least number of colors needed for such a coloring.
Bosek, Bartłomiej   +3 more
openaire   +4 more sources

On hamiltonian chain saturated uniform hypergraphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2012
Graphs and Algorithms We say that a hypergraph H is hamiltonian chain saturated if H does not contain a hamiltonian chain but by adding any new edge we create a hamiltonian chain in H. In this paper we ask about the smallest size of a k-uniform hamiltonian chain saturated hypergraph.
Aneta Dudek, Andrzej Zak
openaire   +4 more sources

Segmentation Studies on Al‐Si‐Mg Metallographic Images Using Various Different Deep Learning Algorithms and Loss Functions

open access: yesEngineering Reports, Volume 7, Issue 4, April 2025.
The overall schematic diagram showing the comparison among various deep learning models for metallographic images. ABSTRACT Segmenting metallographic pictures is being done in material science and related domains in order to detect the features within them. Therefore, it becomes crucial to find grains and secondary phase particles.
Abeyram M. Nithin   +8 more
wiley   +1 more source

Families of triples with high minimum degree are hamiltonian

open access: yesDiscussiones Mathematicae Graph Theory, 2014
In this paper we show that every family of triples, that is, a 3-uniform hypergraph, with minimum degree at least contains a tight Hamiltonian ...
Rödl Vojtech, Ruciński Andrzej
doaj   +1 more source

Monochromatic loose paths in multicolored $k$-uniform cliques [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2019
For integers $k\ge 2$ and $\ell\ge 0$, a $k$-uniform hypergraph is called a loose path of length $\ell$, and denoted by $P_\ell^{(k)}$, if it consists of $\ell $ edges $e_1,\dots,e_\ell$ such that $|e_i\cap e_j|=1$ if $|i-j|=1$ and $e_i\cap e_j=\emptyset$
Andrzej Dudek, Andrzej Ruciński
doaj   +1 more source

Some Spectral Properties of Uniform Hypergraphs [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2014
For a $k$-uniform hypergraph $H$, we obtain some trace formulas for the Laplacian tensor of $H$, which imply that $\sum_{i=1}^nd_i^s$ ($s=1,\ldots,k$) is determined by the Laplacian spectrum of $H$, where $d_1,\ldots,d_n$ is the degree sequence of $H$.
Jiang Zhou   +3 more
openaire   +3 more sources

On the Pre‐ and Post‐Positional Semi‐Random Graph Processes

open access: yesJournal of Graph Theory, Volume 108, Issue 4, Page 819-831, April 2025.
ABSTRACT We study the semi‐random graph process, and a variant process recently suggested by Nick Wormald. We show that these two processes are asymptotically equally fast in constructing a semi‐random graph G $G$ that has property P ${\mathscr{P}}$, for the following examples of P ${\mathscr{P}}$: (1) P ${\mathscr{P}}$ is the set of graphs containing ...
Pu Gao, Hidde Koerts
wiley   +1 more source

Hamilton ℓ-cycles in uniform hypergraphs

open access: yesJournal of Combinatorial Theory, Series A, 2010
v3: corrected very minor error in Lemma 4.6 and the proof of Lemma 6 ...
Deryk Osthus   +2 more
openaire   +3 more sources

On Constrained Minimum Weight Edge Covers With Applications to Emergency Planning

open access: yesNetworks, Volume 85, Issue 3, Page 261-271, April 2025.
ABSTRACT In this paper we present a new covering problem, called Min Cost q$$ q $$‐Single Location Cover, where we are given a fixed positive integer q$$ q $$, a finite ground set J$$ J $$, an integral positive demand dj$$ {d}_j $$ for each element j∈J$$ j\in J $$, a collection 𝒥 of subsets of J$$ J $$, an integral positive cost cS$$ {c}_S $$ and an ...
Shai Dimant, Sven O. Krumke
wiley   +1 more source

Hamiltonicity and $\sigma$-hypergraphs

open access: yesTheory and Applications of Graphs, 2014
We define and study a special type of hypergraph. A $\sigma$-hypergraph $H= H(n,r,q$ $\mid$ $\sigma$), where $\sigma$ is a partition of $r$, is an $r$-uniform hypergraph having $nq$ vertices partitioned into $ n$ classes of $q$ vertices each.
Christina Zarb
doaj   +1 more source

Home - About - Disclaimer - Privacy