ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Mathematics
Technology
Public health
Education
Biology
Medicine / Sub specialtie
Research
Physical
Environment
Social Sciences
all records (71)

Languages
English
Portuguese
Spanish
French
German

Countries
Brazil
USA
Indonesia
Canada
India
Australia
Italy
Chile
Czech Republic
Spain
all records (59)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
1.341  Articles
1 of 135 pages  |  10  records  |  more records»
Twelve Ctenarytaina species with confirmed or suspected associations with Syzygium are revised. The following six new species are diagnosed, described and illustrated: Ctenarytaina baliota Burckhardt sp. nov. (from Malaysia: Sabah), C. daleae Burckhardt s... see more

Hierdie publikasie verskyn op 'n stadium wat die kommando-stelsel weereens onder die soeklig is. In hierdie verband word daar verwys na die onlangse uitspraak van die ANC se parlementêre koukus, waarin die organisasie ten gunste is van die afskaffing van ... see more

Let ?(G) denote the number of components of a graph G. A connected graph G is said to be 1-tough if ?(G - X)=|X| for all X ? V(G) with ?(G - X)>1. It is well-known that every hamiltonian graph is 1-tough, but that the... see more

Let A be a nontrivial abelian group. A connected simple graph G = (V, E) is A-antimagic, if there exists an edge labeling f : E(G)?A \ {0A} such that the induced vertex labeling f+(v)=?{u, v}?E(G)f({u, v}) is a... see more

A Hamiltonian graph G = (V,E) is called hyper-Hamiltonian if G-v is Hamiltonian for any v ? V(G). G is called a circulant if its automorphism group contains a |V(G)|-cycle.  First, we give the necessary and sufficient conditions for any undirected co... see more

In this paper we present some recent multiplicity results for a class of second order Hamiltonian systems. Exploiting the variational structure of the problem, it will be shown how the existence of multiple, even infinitely many, periodic solutions can be... see more

Entre fines del siglo XIX y principios del XX, un grupo de periodistas y escritores que provienen de Uruguay deciden traspasar la frontera del Río de la Plata y buscar una oportunidad en el campo cultural argentino. Primero, se quedan en Buenos Aires, y l... see more

We determine the full automorphism group of each member of three infinite families of connected cubic graphs which are snarks. A graph is said to be nearly hamiltonian if it has a cycle which contains all vertices but one. We prove, in particular, that fo... see more

From Steiner systems S(k - 2, 2k - 3, v), we construct k-uniform hyper- graphs of large size without Hamiltonian cycles. This improves previous estimates due to G. Y. Katona and H. Kierstead [J. Graph Theory 30 (1999), pp.  205–212].

1 of 135 pages  |  10  records  |  more records»