Results 31 to 40 of about 10,769 (289)
Properties of Large 2-Crossing-Critical Graphs
Journal of Graph Algorithms and Applications, 2022 A $c$-crossing-critical graph is one that has crossing number at least $c$ but each of its proper subgraphs has crossing number less than $c$. Recently, a set of explicit construction rules was identified by Bokal, Oporowski, Richter, and Salazar to ...
Drago Bokal +6 more
doaj +1 more source
The chromatic distinguishing index of certain graphs
AKCE International Journal of Graphs and Combinatorics, 2020 The distinguishing index of a graph , denoted by , is the least number of labels in an edge coloring of not preserved by any non-trivial automorphism. The distinguishing chromatic index of a graph is the least number such that has a proper edge coloring ...
Saeid Alikhani, Samaneh Soltani
doaj +1 more source
The harmonious chromatic number of almost all trees [PDF]
, 1995 A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colours appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colours in such a colouring.For any positive integer ...
Edwards, Keith
core +1 more source
On the chromatic index of generalized truncations
Ars Mathematica Contemporanea, 2022 We examine the chromatic index of generalized truncations of graphs and multigraphs.
Alspach, Brian, Joshi, Aditya
openaire +2 more sources
Journal of Graph Theory, 2012 AbstractThe star chromatic index of a graph G is the minimum number of colors needed to properly color the edges of the graph so that no path or cycle of length four is bi‐colored. We obtain a near‐linear upper bound in terms of the maximum degree . Our best lower bound on in terms of Δ is valid for complete graphs. We also consider the special case
Zdenek Dvorák 0001 +2 more
openaire +3 more sources
Mode dispersion and delay characteristics of optical waveguides using equivalent TL circuits [PDF]
, 2005 A new analysis leading to an exact and efficient algorithm is presented for calculating directly and without numerical differentiation the mode dispersion characteristics of cylindrical dielectric waveguides of arbitrary refractive-index profile. The new
Boucouvalas, Anthony C., Qian, Xin
core +1 more source
Strong chromatic index and Hadwiger number [PDF]
, 2022 International audienceWe investigate the effect of a fixed forbidden clique minor upon the strong chromatic index, both in multigraphs and in simple graphs.
Kang, R.J. +11 more
core +1 more source
The b-chromatic index of graphs
Discrete Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Campos +10 more
openaire +2 more sources
Chromatic index, treewidth and maximum degree [PDF]
Electronic Notes in Discrete Mathematics, 2016 We conjecture that any graph $G$ with treewidth $k$ and maximum degree $\Delta(G)\geq k + \sqrt{k}$ satisfies $\chi'(G)=\Delta(G)$. In support of the conjecture we prove its fractional version. We also show that any graph $G$ with treewidth $k\geq 4$ and maximum degree $2k-1$ satisfies $\chi'(G)=\Delta(G)$, extending an old result of Vizing.
Henning Bruhn +2 more
openaire +3 more sources
Strong chromatic index of k-degenerate graphs [PDF]
, 2015 A {\em strong edge coloring} of a graph $G$ is a proper edge coloring in which every color class is an induced matching. The {\em strong chromatic index} $\chiup_{s}'(G)$ of a graph $G$ is the minimum number of colors in a strong edge coloring of $G$. In
Wang, Tao
core +2 more sources