Results 41 to 50 of about 6,626,501 (294)
Generalized total colorings of graphs
An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphism. Let P and Q be additive hereditary properties of graphs. A (P ,Q)-total coloring ∗Research supported in part by Slovak VEGA Grant 2/0194/10. 210 M. Borowiecki, A. Kemnitz, M. Marangio and P.
Mieczyslaw Borowiecki +3 more
openaire +2 more sources
Odd-Graceful Total Colorings for Constructing Graphic Lattice
The security of passwords generated by the graphic lattices is based on the difficulty of the graph isomorphism, graceful tree conjecture, and total coloring conjecture.
Jing Su, Hui Sun, Bing Yao
doaj +1 more source
Let G be a graph and ϕ:V(G)∪E(G)→{1,2,3,…,k} be a k-total coloring. Let w(v) denote the sum of color on a vertex v and colors assigned to edges incident to v.
Patcharapan Jumnongnit +1 more
doaj +1 more source
New Results on Edge-Coloring and Total-Coloring of Split Graphs
20 pages, 5 ...
Fernanda Couto +2 more
openaire +4 more sources
Asymmetric game perfect graphs and the circular coloring game of weighted graphs [PDF]
Zacharopoulos P. Asymmetric game perfect graphs and the circular coloring game of weighted graphs.
Zacharopoulos, Panagiotis
core
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +1 more source
A proof of the Total Coloring Conjecture
No major changes in this third-version apart from addition of Remark 3.5, corrections of typos, and some minor refinements in explanation as and where it was ...
openaire +3 more sources
A study of the total coloring of graphs. [PDF]
The area of total coloring is a more recent and less studied area than vertex and edge coloring, but recently, some attention has been given to the Total Coloring Conjecture, which states that each graph\u27s total chromatic number xT is no greater than ...
Leidner, Maxfield Edwin
core +1 more source
Plasma membranes contain dynamic nanoscale domains that organize lipids and receptors. Because viruses operate at similar scales, this architecture shapes early infection steps, including attachment, receptor engagement, and entry. Using influenza A virus and HIV‐1 as examples, we highlight how receptor nanoclusters, multivalent glycan interactions ...
Jan Schlegel, Christian Sieben
wiley +1 more source
Fractional (P,Q)-Total List Colorings of Graphs
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

