Results 91 to 100 of about 1,402,601 (292)
The total chromatic number of some bipartite graphs
Electronic Notes in Discrete Mathematics, 2005 Abstract The total chromatic number χ T ( G ) is the least number of colours needed to colour the vertices and edges of a graph G such that no incident or adjacent elements (vertices or edges) receive the same colour. This work determines the total chromatic number of grids, particular cases of partial grids, near-ladders, and k ...
C. N. Campos, Célia Picinin de Mello
openaire +1 more source
Advanced Science, EarlyView.A multimodal intravital imaging platform enables longitudinal tracking of human cortical organoids transplanted into chronic stroke lesions. By combining surgical microscopy, MRI, bioluminescence imaging, and two‐photon fluorescence microscopy, the platform captures graft placement, viability dynamics, and cellular‐scale morphology in vivo, offering a ...
Jinghui Wang +12 more
wiley +1 more source
Total chromatic number of generalized Mycielski graphs
Discrete Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Meirun Chen +3 more
openaire +1 more source
On Adjacent Vertex-distinguishing Total Chromatic Number of Generalized Mycielski Graphs
, 2017 The adjacent vertex-distinguishing total chromatic number of a graph $G$, denoted by $\chi_{at}(G)$, is the smallest $k$ for which $G$ has a proper total $k$-coloring such that any two adjacent vertices have distinct sets of colors appearing on the ...
Enqiang Zhu, Chanjuan Liu, Jin Xu
semanticscholar +1 more source
Advanced Science, EarlyView.A continuous conductivity gradient is formed in a porous MXene/melamine foam via directional evaporation, thereby improving impedance matching and enhancing electromagnetic attenuation. The resulting monolithic composite delivers absorption‐dominant EMI shielding with ultralow reflection, offering a simple route toward lightweight EMI shielding ...
Dawei Zhang +6 more
wiley +1 more source
Fractional (P,Q)-Total List Colorings of Graphs
Discussiones Mathematicae Graph Theory, 2013 Let r, s ∈ N, r ≥ s, and P and Q be two additive and hereditary graph properties. A (P,Q)-total (r, s)-coloring of a graph G = (V,E) is a coloring of the vertices and edges of G by s-element subsets of Zr such that for each color i, 0 ≤ i ≤ r − 1, the ...
Kemnitz Arnfried +2 more
doaj +1 more source
Advanced Science, EarlyView.Optimizing the heterointerface coverage of the conducting Ni2P nanoparticles on the surface of BVO photoanode manipulates the surface Fermi‐level modulation, which significantly enhances photoelectrochemical oxygen evolution reaction. Our multiscale simulations and experimental results reveal that an optimal Ni2P coverage of 9.4% pins the surface Fermi
Phuong Thi Pham +14 more
wiley +1 more source
Hamiltonicity and Generalised Total Colourings of Planar Graphs
Discussiones Mathematicae Graph Theory, 2016 The total generalised colourings considered in this paper are colourings of graphs such that the vertices and edges of the graph which receive the same colour induce subgraphs from two prescribed hereditary graph properties while incident elements ...
Borowiecki Mieczysław, Broere Izak
doaj +1 more source
An Algorithmic Approach to Equitable Total Chromatic Number of Graphs
, 2017 The equitable total coloring of a graph G is a combination of vertex and edge coloring whose color classes differs by atmost one. In this paper, we find the equitable total chromatic number for Sn, Wn, Hn and Gn.
J. V. Vivik, G. Girija
semanticscholar +1 more source
Advanced Science, EarlyView.Precursor stoichiometry programs the surface chemistry of carbon dots, directing their self‐assembly into distinct aggregation modes. Aldehyde‐enriched surfaces form ordered, hydrogen‐bonded assemblies that enable bright red solid‐state fluorescence, whereas amine‐rich surfaces promote compact π–π stacked aggregates with broadband visible‐light ...
Gaixia Yang +8 more
wiley +1 more source