Results 61 to 70 of about 90,789 (282)

A new species of Lonchidiidae (Hybodontiformes) from the Late Jurassic of Brazil (Aliança Formation, Jatobá Basin)

open access: yesThe Anatomical Record, EarlyView.
Abstract The Aliança Formation (Jatobá Basin) represents lacustrine deposits formed in oxygenated waters that hosted a diverse fauna, including Hybodontiform sharks. Within this group, the Family Lonchidiidae comprises 11 valid genera, with Parvodus previously reported in Brazilian deposits from the Brejo Santo Formation (Araripe Basin, Late Jurassic ...
Larissa de Souza Ribeiro   +1 more
wiley   +1 more source

Characteristics of Complexity: Clique Number of a Polytope Graph and Rectangle Covering Number

open access: yesМоделирование и анализ информационных систем, 2014
In the 1980s V.A. Bondarenko found that the clique number of the graph of a polytope in many cases corresponds to the actual complexity of the optimization problem on the vertices of the polytope.
A. N. Maksimenko
doaj   +1 more source

Ramsey numbers of cubes versus cliques [PDF]

open access: yesCombinatorica, 2014
26 ...
Conlon, David   +3 more
openaire   +5 more sources

MicroCT reinvestigation of the only articulated fossil anostomid fish reveals synonymy of Arhinolemur Ameghino, 1898 and Megaleporinus Ramirez et al., 2017

open access: yesThe Anatomical Record, EarlyView.
Abstract Arhinolemur scalabrinii† Ameghino, 1898 was originally described as a strepsirrhine primate (Mammalia) but has been recognized as an anostomid fish since 2012. It remains the only extinct anostomid species known from complete cranial material.
Karen M. Panzeri   +8 more
wiley   +1 more source

Computing maximum cliques in $B_2$-EPG graphs

open access: yes, 2017
EPG graphs, introduced by Golumbic et al. in 2009, are edge-intersection graphs of paths on an orthogonal grid. The class $B_k$-EPG is the subclass of EPG graphs where the path on the grid associated to each vertex has at most $k$ bends.
D Epstein, M Bougeret, M Pergel
core   +1 more source

Ramsey Numbers of Connected Clique Matchings

open access: yesThe Electronic Journal of Combinatorics, 2017
We determine the Ramsey number of a connected clique matching. That is, we show that if $G$ is a $2$-edge-coloured complete graph on $(r^2-r-1)n-r+1$ vertices, then there is a monochromatic connected subgraph containing $n$ disjoint copies of $K_r$, and that this number of vertices cannot be reduced.
openaire   +4 more sources

Reciprocity on the Edge of Distance Paradox: How Sustainability Motives and Hypocrisy Shape Consumer Responses to Nearshoring

open access: yesBusiness Strategy and the Environment, EarlyView.
ABSTRACT Despite growing interest in corporate relocation decisions and sustainability, the existing literature is limited in its consumer‐centric approach. Integrating social exchange theory and construal level theory, this research investigates how consumers perceive sustainability‐driven nearshoring motives (i.e., socio‐economic vs.
Cagla Dayangan   +2 more
wiley   +1 more source

The Political Psychology Behind Consumer Decisions: The Complex Relationship Between Political Ideology and Political Consumerism

open access: yesJournal of Consumer Behaviour, EarlyView.
ABSTRACT Political consumerism (PC) refers to consumers boycotting or deliberately buying (“buycotting”) products or brands for political, moral, or ethical reasons. This paper presents three studies that consider the intricacies of the relationship between political ideology and political consumerism.
Lara J. Greening   +3 more
wiley   +1 more source

Clique roots of K4-free chordal graphs

open access: yesElectronic Journal of Graph Theory and Applications, 2019
The clique polynomial C(G, x) of a finite, simple and undirected graph G = (V, E) is defined as the ordinary generating function of the number of complete subgraphs of G. A real root of C(G, x) is called a clique root of the graph G.
Hossein Teimoori Faal
doaj   +1 more source

Number of cliques in random scale-free network ensembles

open access: yes, 2006
In this paper we calculate the average number of cliques in random scale-free networks. We consider first the hidden variable ensemble and subsequently the Molloy Reed ensemble. In both cases we find that cliques, i.e.
Albert   +22 more
core   +1 more source

Home - About - Disclaimer - Privacy