Results 81 to 90 of about 16,499 (231)
Proceedings of the American Mathematical Society, 2016 A majority digraph is a finite simple digraph G = ( V ,
Lai, Tri +2 more
openaire +4 more sources
Subdivisions of oriented cycles in digraphs with large chromatic number [PDF]
Journal of Graph Theory, 2016 An oriented cycle is an orientation of a undirected cycle. We first show that for any oriented cycle C, there are digraphs containing no subdivision of C (as a subdigraph) and arbitrarily large chromatic number.
Nathann Cohen +3 more
semanticscholar +1 more source
Allocation of Indivisible Items With a Common Preference Graph: Minimizing Total Dissatisfaction
Networks, EarlyView.ABSTRACT Allocating indivisible items among a set of agents is a frequently studied discrete optimization problem. In the setting considered in this work, the agents' preferences over the items are assumed to be identical. We consider a very recent measure for the overall quality of an allocation which does not rely on numerical valuations of the items.
Nina Chiarelli +6 more
wiley +1 more source
Discrete Mathematics, 1988 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
MARCHIORO P. +3 more
openaire +3 more sources
On locally irregular decompositions and the 1-2 Conjecture in digraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 The 1-2 Conjecture raised by Przybylo and Wozniak in 2010 asserts that every undirected graph admits a 2-total-weighting such that the sums of weights "incident" to the vertices yield a proper vertex-colouring.
Olivier Baudon +3 more
doaj +1 more source
A Theorem on Even Pancyclic Bipartite Digraphs
Mathematical Problems of Computer Science, 2021 We prove a Meyniel-type condition and a Bang-Jensen, Gutin and Li-type condition for a strongly connected balanced bipartite digraph to be even pancyclic. Let D be a balanced bipartite digraph of order 2a ≥ 6.
Samvel Kh. Darbinyan
doaj +1 more source
Interdiction Models and Heuristics for Graph Propagation
Networks, EarlyView.ABSTRACT Given a graph G=(V,E)$$ G=\left(V,E\right) $$ and a set S⊂V$$ S\subset V $$ of activated/infected nodes, we consider the problem of determining the set of c$$ c $$ nodes that minimizes the network propagation on the subgraph that results from the removal of those c$$ c $$ nodes. To measure network propagation, we assume that a node i$$ i $$ is
Agostinho Agra, José Maria Samuco
wiley +1 more source
Lexical Syllabus in Elementary and Secondary Education: Construction and Implementation
TESOL Quarterly, EarlyView.Abstract Nonnative language users operate with significantly limited vocabularies compared to native speakers, particularly when the language is learnt in school contexts. This paper demonstrates how empirical research on vocabulary learning combined with experience in teaching and curricula design has informed the principled construction of a lexical ...
Batia Laufer
wiley +1 more source
Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number [PDF]
Electronic Journal of Combinatorics, 2016 In 1985, Mader conjectured the existence of a function $f$ such that every digraph with minimum out-degree at least $f(k)$ contains a subdivision of the transitive tournament of order $k$.
Pierre Aboulker +5 more
semanticscholar +1 more source
The superposition method for the reconstruction of food webs
Methods in Ecology and Evolution, EarlyView.Abstract Understanding trophic positions is essential for analysing complex food webs. While calculating these positions can be straightforward when feeding relationships and their proportions are known, determining diet coefficients traditionally requires substantial time and effort.
Ettore Barbieri, Naoto F. Ishikawa
wiley +1 more source