Results 21 to 30 of about 28,564 (220)
From light edges to strong edge-colouring of 1-planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 A strong edge-colouring of an undirected graph $G$ is an edge-colouring where every two edges at distance at most~$2$ receive distinct colours. The strong chromatic index of $G$ is the least number of colours in a strong edge-colouring of $G$.
Julien Bensmail +3 more
doaj +1 more source
INTEGRABLE COMBINATORICS [PDF]
Proceedings of the International Congress of Mathematicians (ICM 2018), 2013 We review various combinatorial problems with underlying classical or quantum integrable structures. (Plenary talk given at the International Congress of Mathematical Physics, Aalborg, Denmark, August 10, 2012.)
openaire +4 more sources
Combinatorial optimization in networks with Shared Risk Link Groups [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 The notion of Shared Risk Link Groups (SRLG) captures survivability issues when a set of links of a network may fail simultaneously. The theory of survivable network design relies on basic combinatorial objects that are rather easy to compute in the ...
David Coudert +3 more
doaj +1 more source
On Proper (Strong) Rainbow Connection of Graphs
Discussiones Mathematicae Graph Theory, 2021 A path in an edge-colored graph G is called a rainbow path if no two edges on the path have the same color. The graph G is called rainbow connected if between every pair of distinct vertices of G, there is a rainbow path.
Jiang Hui +3 more
doaj +1 more source
Odd Harmonious Labeling of Pn ⊵ C4 and Pn ⊵ D2(C4)
Indonesian Journal of Combinatorics, 2021 A graph G with q edges is said to be odd harmonious if there exists an injection f:V(G) → ℤ2q so that the induced function f*:E(G)→ {1,3,...,2q-1} defined by f*(uv)=f(u)+f(v) is a bijection.Here we show that graphs constructed by edge comb product of ...
Sabrina Shena Sarasvati +2 more
doaj +1 more source
A case for combinatorics: A research commentary
Journal of Mathematical Behavior, 2020 In this commentary, we make a case for the explicit inclusion of combinatorial topics in mathematics curricula, where it is currently essentially absent. We suggest ways in which researchers might inform the field’s understanding of combinatorics and its
E. Lockwood +2 more
semanticscholar +1 more source
Newton polytopes in algebraic combinatorics [PDF]
Selecta Mathematica, 2017 A polynomial has saturated Newton polytope (SNP) if every lattice point of the convex hull of its exponent vectors corresponds to a monomial. We compile instances of SNP in algebraic combinatorics (some with proofs, others conjecturally): skew Schur ...
C. Monical, Neriman Tokcan, A. Yong
semanticscholar +1 more source
Skew Randi'c matrix and skew Randi'c energy [PDF]
Transactions on Combinatorics, 2016 Let $G$ be a simple graph with an orientation $sigma$, which assigns to each edge a direction so that $G^sigma$ becomes a directed graph. $G$ is said to be the underlying graph of the directed graph $G^sigma$.
Ran Gu, Fei Huang, Xueliang Li
doaj
On interval number in cycle convexity [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Recently, Araujo et al. [Manuscript in preparation, 2017] introduced the notion of Cycle Convexity of graphs. In their seminal work, they studied the graph convexity parameter called hull number for this new graph convexity they proposed, and they ...
Julio Araujo +3 more
doaj +1 more source
Complexity problems in enumerative combinatorics [PDF]
International Congress of Mathematicans, 2018 We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects.
I. Pak
semanticscholar +1 more source