Results 61 to 70 of about 33,621 (316)
Strong parity vertex coloring of plane graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 A strong parity vertex coloring of a 2-connected plane graph is a coloring of the vertices such that every face is incident with zero or an odd number of vertices of each color.
Tomas Kaiser +3 more
doaj +1 more source
Homologous expression and purification of human HAX‐1 for structural studies
FEBS Open Bio, EarlyView.This research protocol provides detailed instructions for cloning, expressing, and purifying large quantities of the intrinsically disordered human HAX‐1 protein, N‐terminally fused to a cleavable superfolder GFP, from mammalian cells. HAX‐1 is predicted to undergo posttranslational modifications and to interact with membranes, various cellular ...
Mariana Grieben
wiley +1 more source
Animation Visualization for Vertex Coloring of Polyhedral Graphs [PDF]
Journal of Systemics, Cybernetics and Informatics, 2013 Vertex coloring of a graph is the assignment of labels to the vertices of the graph so that adjacent vertices have different labels. In the case of polyhedral graphs, the chromatic number is 2, 3, or 4. Edge coloring problem and face coloring problem can
Hidetoshi Nonaka
doaj
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs
, 2014 We study the problem of transforming one list (vertex) coloring of a graph into another list coloring by changing only one vertex color assignment at a time, while at all times maintaining a list coloring, given a list of allowed colors for each vertex ...
Hatanaka, Tatsuhiko +2 more
core +1 more source
Hierarchical and modularly-minimal vertex colorings
The Art of Discrete and Applied Mathematics, 2022 Cographs are exactly the hereditarily well-colored graphs, i.e., the graphs for which a greedy vertex coloring of every induced subgraph uses only the minimally necessary number of colors $χ(G)$. We show that greedy colorings are a special case of the more general hierarchical vertex colorings, which recently were introduced in phylogenetic ...
Valdivia, Dulce I. +4 more
openaire +3 more sources
Diffusion Tractography Biomarker for Epilepsy Severity in Children With Drug‐Resistant Epilepsy
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To develop a novel deep‐learning model of clinical DWI tractography that can accurately predict the general assessment of epilepsy severity (GASE) in pediatric drug‐resistant epilepsy (DRE) and test if it can screen diverse neurocognitive impairments identified through neuropsychological assessments.
Jeong‐Won Jeong +7 more
wiley +1 more source
Interval Vertex-Coloring of a Graph With Forbidden Colors
Discrete Mathematics, 1989 The classical model of coloring the vertices of a graph with single colors so that no two adjacent vertices are colored the same is too limited to be useful in many practical applications. Therefore one must consider more general notions of graph coloring and this article is devoted to one of such generalizations.
openaire +3 more sources
A note on acyclic vertex-colorings [PDF]
Journal of Combinatorics, 2016 We prove that the acyclic chromatic number of a graph with maximum degree $\Delta$ is less than $2.835\Delta^{4/3}+\Delta$. This improves the previous upper bound, which was $50\Delta^{4/3}$. To do so, we draw inspiration from works by Alon, McDiarmid and Reed and by Esperet and Parreau.
Sereni, Jean-Sébastien, Volec, Jan
openaire +4 more sources
Advanced Engineering Materials, EarlyView.The utilization of direct energy deposition (DED)‐arc additive manufacturing processes in industrial applications is increasing, and these processes have the potential for multi‐material applications. This work provides a overview of the state of research in DED‐arc made functional graded structures, to establish a link to potential industrial ...
Kai Treutler, Volker Wesling
wiley +1 more source
The list Distinguishing Number Equals the Distinguishing Number for Interval Graphs
Discussiones Mathematicae Graph Theory, 2017 A distinguishing coloring of a graph G is a coloring of the vertices so that every nontrivial automorphism of G maps some vertex to a vertex with a different color. The distinguishing number of G is the minimum k such that G has a distinguishing coloring
Immel Poppy, Wenger Paul S.
doaj +1 more source