Results 231 to 240 of about 11,475 (265)
Decomposing clique search problems into smaller instances based on node and edge colorings
Sándor Szabó, Bogdán Zaválnij
openalex +1 more source
Adipose-Derived Mesenchymal Stem Cells Accelerate Diabetic Foot Ulcer Healing by Promoting Macrophage M2 Polarization Through Downregulation of <i>EREG</i> and <i>CSTA</i>. [PDF]
Cao J +10 more
europepmc +1 more source
The Structure of Simple Satellite Variation in the Human Genome and Its Correlation With Centromere Ancestry. [PDF]
Said I, Barbash DA, Clark AG.
europepmc +1 more source
Coloring $Δ$-Critical Graphs With Small High Vertex Cliques
Landon Rabern
openalex +1 more source
A novel approach to graph distinction through GENEOs and permutants. [PDF]
Bocchi G, Ferri M, Frosini P.
europepmc +1 more source
Relaxations of semidefinite programming for graph coloring and maximal clique problems
Lana Šprajc
openalex
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Clique-Coloring Claw-Free Graphs
Graphs and Combinatorics, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liang, Zuosong +2 more
openaire +3 more sources
Iterative coloring extension of a maximum clique
Naval Research Logistics (NRL), 2001AbstractIn this paper we present an improved branch and bound algorithm for the vertex coloring problem. The idea is to try to extend the coloring of a maximum clique to its adjacent vertices. If this succeeds, its successive neighbors are considered; in case of failure (i.e., in the case the initial colors are not sufficient), working on the subgraph ...
CARAMIA M., DELL'OLMO, Paolo
openaire +8 more sources

