Results 51 to 60 of about 10,769 (289)
Acyclic, Star and Oriented Colourings of Graph Subdivisions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Let G be a graph with chromatic number χ (G). A vertex colouring of G is \emphacyclic if each bichromatic subgraph is a forest. A \emphstar colouring of G is an acyclic colouring in which each bichromatic subgraph is a star forest. Let χ _a(G) and χ _s(G)
David R. Wood
doaj +3 more sources
The irregular chromatic index of trees [PDF]
, 2013 A graph G is locally irregular if adjacent vertices of G have distinct degrees. An edge colouring of G is locally irregular if each of its colours induces a locally irregular subgraph of G. The irregular chromatic index of G refers to the least number of
Baudon, Olivier +2 more
core +4 more sources
On the Star Chromatic Index of Generalized Petersen Graphs
Discussiones Mathematicae Graph Theory, 2021 The star k-edge-coloring of graph G is a proper edge coloring using k colors such that no path or cycle of length four is bichromatic. The minimum number k for which G admits a star k-edge-coloring is called the star chromatic index of G, denoted by χ′s (
Zhu Enqiang, Shao Zehui
doaj +1 more source
The Circular Chromatic Index of Flower Snarks [PDF]
The Electronic Journal of Combinatorics, 2006 We determine the circular chromatic index of flower snarks, by showing that $\chi'_c(F_{3})=7/2$, $\chi'_c(F_{5})=17/5$ and $\chi'_c(F_{k})=10/3$ for every odd integer $k\ge 7$, where $F_k$ denotes the flower snark on $4k$ vertices.
Mohammad Ghebleh +3 more
openaire +2 more sources
Chromatic index critical graphs of order 9. [PDF]
, 1983 We prove that a 2-connected graph of order 9 having maximum valency Δ 4 is chromatic index critical if and only if its valency-list is one of the following: 248, 3247 (except one graph), 258, 3457, 4356, 268, 3567, 4267, 45266, 5465, 278, 3677, 4577 ...
Yap, H.P. +2 more
core +1 more source
Multilayer Self‐Limiting Electrospray Deposition via Stepped Voltage Bias
Advanced Engineering Materials, EarlyView.Self‐limiting electrospray deposition (SLED) uses a high voltage to generate and deposit a charged payload on a target surface. The coating retains its charge, repelling newly arriving material. SLED thickness can be decreased by applying a secondary bias to the target.
Madhuri Deb +3 more
wiley +1 more source
Strong chromatic index of subcubic planar multigraphs [PDF]
, 2016 The strong chromatic index of a multigraph is the minimum k such that the edge set can be k-colored requiring that each color class induces a matching. We verify a conjecture of Faudree, Gyarfas, Schelp and Tuza, showing that every planar multigraph with
Kostochka, A. V. +3 more
core +1 more source
Oriented Incidence Colourings of Digraphs
Discussiones Mathematicae Graph Theory, 2019 Brualdi and Quinn Massey [6] defined incidence colouring while study- ing the strong edge chromatic index of bipartite graphs. Here we introduce a similar concept for digraphs and define the oriented incidence chromatic number.
Duffy Christopher +3 more
doaj +1 more source
The strong chromatic index of 1-planar graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceThe chromatic index $\chi'(G)$ of a graph $G$ is the smallest $k$ for which $G$ admits an edge $k$-coloring such that any two adjacent edges have distinct colors.
Yiqiao Wang +3 more
doaj +1 more source
Advanced Engineering Materials, EarlyView.Residual adhesive after electrode loading in adhesive‐assisted resistance spot welding is quantified through a traceable experimental‐to‐digital workflow. Chromatic confocal topography provides calibrated surface‐height data, while OpenCV detects the electrode imprint and integrates adhesive height into comparable volume metrics.
Sung‐Min Wi, Jiangdong Zhao
wiley +1 more source