Results 81 to 90 of about 1,402,601 (292)

Total colorings of some classes of four regular circulant graphs

open access: yesAKCE International Journal of Graphs and Combinatorics
The total chromatic number, [Formula: see text] is the minimum number of colors which need to be assigned to obtain a total coloring of the graph G. The Total Coloring Conjecture (TCC) made independently by Behzad and Vizing that for any graph, [Formula:
R. Navaneeth   +3 more
doaj   +1 more source

The History of the Total Chromatic Number Conjecture

open access: yes, 2011
The total chromatic number conjecture which has appeared in a few hundred articles and in numerous books thus far is now one of the classic mathematical unsolved problems. It appears that many authors coincidentally have attributed it to Professor M. Behzad and/or to Professor V. G. Vizing. Eventually after four decades, Professor A.
openaire   +3 more sources

The total-chromatic number of some families of snarks

open access: yesDiscrete Mathematics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
C. N. Campos   +2 more
openaire   +2 more sources

Lead‐Free Chiral Hybrid Metal Halides for Circularly Polarized Light‐Emitting Diodes

open access: yesAdvanced Optical Materials, EarlyView.
Lead‐free chiral hybrid metal halides provide a versatile platform for realizing chiroptical responses through chiral modulation of metal–halide frameworks with diverse dimensionalities, induces inversion‐symmetry breaking and enables dissymmetric excited‐state transitions toward efficient circularly polarized luminescence and electroluminescence. This
Kun Zhu, Li Wan
wiley   +1 more source

A total-chromatic number analogue of plantholt's theorem

open access: yesDiscrete Mathematics, 1990
Let \(n\geq 1\), let J be a subgraph of \(K_{2n}\), let \(e=| E(J)|\) and let j be the maximum size of a matching in J. In this paper it is proved that \(\chi_ T(K_{2n}\setminus E(J))=2n+1\) \((=\chi_ T(K_{2n}))\) if and only if \(e+j\leq n-1,\) thus obtaining a total- chromatic number analogue of Plantholt's theorem about the chromatic index of the ...
openaire   +2 more sources

The total geo chromatic number of a graph

open access: yesMalaya Journal of Matematik, 2020
A total geo chromatic set of a graph \(G\) is a geo chromatic set \(S_c\) such that the subgraph induced by \(S_c\) has no isolated vertices. The minimum cardinality of a total geo chromatic set of \(G\) is the total geo chromatic number of \(G\) and is denoted by \(\chi_{t g}(G)\). A total geo chromatic set of cardinality \(\chi_{t g}(G)\) is called a
null S. Annie Ajila   +1 more
openaire   +1 more source

Nanoporous Scaffold‐Assisted Ligand‐Free CsPbBr3 Quantum Dots for Bright and Ultrapure Green Light‐Emitting Diodes

open access: yesAdvanced Optical Materials, EarlyView.
Networks of confined CsPbBr3 perovskite quantum dots, synthesised within nanoporous silica scaffolds using precursors containing different combinations of butylammonium bromide and crown ether additives, enable electroluminescent devices with 400‐fold enhanced charge injection and transport with respect to control devices, yielding ultrapure green ...
Carlos Romero‐Pérez   +4 more
wiley   +1 more source

On the set of circular total chromatic numbers of graphs

open access: yesDiscrete Mathematics, 2013
For every integer $r\ge3$ and every $\eps>0$ we construct a graph with maximum degree $r-1$ whose circular total chromatic number is in the interval $(r,r+\eps)$. This proves that (i) every integer $r\ge3$ is an accumulation point of the set of circular total chromatic numbers of graphs, and (ii) for every $Δ\ge2$, the set of circular total ...
openaire   +2 more sources

Upper Bounds for the Total Chromatic Number of Join Graphs and Cobipartite Graphs

open access: yesInternational Conference on Operations Research and Enterprise Systems, 2018
We concern ourselves with the combinatorial optimisation problem of determining a minimum total colouring of a graph G for the case wherein G is a join graph G = G1 ∗G2 or a cobipartite graph G = (V1 ∪V2,E(G)).
L. Zatesko, R. Carmo, A. Guedes
semanticscholar   +1 more source

TacScope: A Miniaturized Vision‐Based Tactile Sensor for Surgical Applications

open access: yesAdvanced Robotics Research, EarlyView.
TacScope is a compact, vision‐based tactile sensor designed for robot‐assisted surgery. By leveraging a curved elastomer surface with pressure‐sensitive particle redistribution, it captures high‐resolution 3D tactile feedback. TacScope enables accurate tumor detection and shape classification beneath soft tissue phantoms, offering a scalable, low‐cost ...
Md Rakibul Islam Prince   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy