Results 31 to 40 of about 215 (116)
On the neighbour sum distinguishing index of planar graphs
, 2016 Let $c$ be a proper edge colouring of a graph $G=(V,E)$ with integers $1,2,\ldots,k$. Then $k\geq \Delta(G)$, while by Vizing's theorem, no more than $k=\Delta(G)+1$ is necessary for constructing such $c$. On the course of investigating irregularities in
Bonamy, Marthe, Przybyło, Jakub
core +2 more sources
Extension from precoloured sets of edges [PDF]
, 2018 We consider precolouring extension problems for proper edge-colourings of graphs and multigraphs, in an attempt to prove stronger versions of Vizing's and Shannon's bounds on the chromatic index of (multi)graphs in terms of their maximum degree Δ. We are
Edwards, Katherine +5 more
core +7 more sources
Neuroticism, Internalizing Psychopathology, and Affective Reactions to Thought Content in Daily Life
Journal of Personality, EarlyView.ABSTRACT Introduction This study examined affective reactions to thought content (TC) in daily life and the influence of neuroticism and internalizing symptoms. Methods Community young adults (N = 119; n = 80 with elevated depression/anxiety) completed assessments of neuroticism, internalizing symptoms, and daily diary measures of TC and positive ...
Henry R. Cowan +5 more
wiley +1 more source
APPLICATING CVD ALGORITHM ON EDGE-COLORING OF SPECIAL GRAPHS [PDF]
, 2014 Heuristics algorithm is a soultion method that typically relatively quick to find a feasibel soloution with reasonable time and quality though there are no guarantees about if the quality of the solution is bad.
Nur, Insani
core
Annual Research Review: Early conduct problems – precursors, outcomes, and etiology
Journal of Child Psychology and Psychiatry, Volume 67, Issue 4, Page 524-545, April 2026.During the toddler and preschool period, nearly all children engage in some level of aggression, defiance, stealing, and temper tantrums. While the frequency and intensity of these behaviors tends to decrease across early childhood, a subset of children engage in these conduct problem behaviors at a higher intensity early in life and/or do not desist ...
Luke W. Hyde +2 more
wiley +1 more source
Some results on Vizing’s conjecture and related problems
Discrete Applied Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pilipczuk, Marcin +2 more
openaire +1 more source
An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture [PDF]
Proceedings of the 2019 International Symposium on Symbolic and Algebraic Computation, 2019 Vizing's conjecture (open since 1968) relates the sizes of dominating sets in two graphs to the size of a dominating set in their Cartesian product graph. In this paper, we formulate Vizing's conjecture itself as a Positivstellensatz existence question.
Gaar, Elisabeth +3 more
openaire +4 more sources
Time complexity analysis of RLS and (1 + 1) EA for the edge coloring problem [PDF]
, 2019 The edge coloring problem asks for an assignment of colors to edges of a graph such that no two incident edges share the same color and the number of colors is minimized.
Bossek, J., Sudholt, D.
core +1 more source
Political Psychology, Volume 47, Issue 2, April 2026.Abstract Rising global and local inequalities make prejudice based on social class an increasingly pressing issue, yet it remains underexplored in psychological literature. Across three studies run in Poland, we apply the Dual‐Process Model of Ideology and Prejudice and find that Social Dominance Orientation (SDO)—a preference for social hierarchy ...
Maciej R. Górski +2 more
wiley +1 more source
Graph Structure and Coloring [PDF]
, 2014 We denote by G=(V,E) a graph with vertex set V and edge set E. A graph G is claw-free if no vertex of G has three pairwise nonadjacent neighbours. Claw-free graphs are a natural generalization of line graphs.
Plumettaz, Matthieu
core +2 more sources