Results 271 to 280 of about 34,319 (321)

Recovering the polyhedral geometry of fragments. [PDF]

MethodsX
Török J, Domokos G.
europepmc   +1 more source

Multi-stimulus responsive polyoxometalate-viologen hybrid ionic liquids for rewritable inkless printing and environmental monitoring. [PDF]

RSC Adv
Deng H, Jia S, Zhang Y, Zhang Y, Shao J, Afzal MW, Liu X, Dang D, Bai Y.   +8 more
europepmc   +1 more source

An exact algorithm to find a maximum weight clique in a weighted undirected graph. [PDF]

Sci Rep
Rozman K, Ghysels A, Janežič D, Konc J.   +3 more
europepmc   +1 more source

Knot theory and error-correcting codes. [PDF]

Des Codes Cryptogr
Kılıç AB, Nijsten A, Pellikaan R, Ravagnani A.   +3 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Vertex-Colored Encompassing Graphs

Graphs and Combinatorics, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hoffmann Michael, Tóth Csaba D.
openaire   +2 more sources

Triangulating Vertex-Colored Graphs

SIAM Journal on Discrete Mathematics, 1994
This paper examines the class of vertex-colored graphs that can be triangulated without the introduction of edges between vertices of the same color. This is related to the perfect phylogeny problem. An algorithm based on dynamic programming is proposed to solve the problem.
McMorris, F. R., Warnow, Tandy J., Wimer, Thomas   +2 more
openaire   +1 more source

Monochromatic Vertex-Disconnection Colorings of Graphs

Bulletin of the Malaysian Mathematical Sciences Society, 2022
Let \(G\) be a vertex-coloured connected graph (adjacent vertices can be given the same colour). A subset \(U\) of the vertex-set of \(G\) is said to be monochromatic if all the vertices of \(U\) are assigned the same colour. The graph \(G\) is said to be monochromatic vertex-disconnected if, for a two distinct vertices \(x\) and \(y\), there is a ...
Yanhong Gao, Xueliang Li
openaire   +2 more sources

Interval vertex coloring

Applied Mathematics and Computation
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mária Maceková, Zuzana Šárošiová, Roman Soták   +2 more
openaire   +2 more sources

Uncertain vertex coloring problem

Soft Computing, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Lin, Peng, Jin, Ralescu, Dan A.
openaire   +2 more sources