Results 191 to 200 of about 5,057 (262)

AVOIDING RAINBOW INDUCED SUBGRAPHS IN VERTEX-COLORINGS

open access: yes, 2008
. For a fixed graph H on k vertices, and a graph G on at least k vertices, we write G − → H if in any vertex-coloring of G with k colors, there is an induced subgraph isomorphic to H whose vertices have distinct colors.
Maria Axenovich, Ryan Martin
core  

Rapid Exploration of the Assembly Chemical Space of Molecular Graphs. [PDF]

open access: yesJ Chem Inf Model
Seet I   +4 more
europepmc   +1 more source

Network design for bypass roads using interval valued fuzzy outerplanar graphs. [PDF]

open access: yesSci Rep
Jaisankar D   +3 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy