Results 41 to 50 of about 8,970,965 (255)
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
A Different Short Proof of Brooks’ Theorem
Lovász gave a short proof of Brooks’ theorem by coloring greedily in a good order. We give a different short proof by reducing to the cubic case.
Rabern Landon
doaj +1 more source
Ideal based graph structures for commutative rings
We introduce a graph structure $\gamrr$ for commutative rings with unity. We study some of the properties of the graph $\gamrr$. Also we study some parameters of $\gamrr$ and find rings for which $\gamrr$ is split.
M. I. Jinnah, Shine C. Mathew
doaj +1 more source
Abstract The ‘Palaeogene strata’ of the Itaboraí Basin (upper Paleocene‐lower Eocene), Southeastern Brazil, has preserved 29 genera and almost 50 species of metatherians (about 65% of its mammalian diversity). Among them, Eobrasilia coutoi Simpson, 1947 is the most enigmatic due to its quite fragmentary nature.
Leonardo M. Carneiro +10 more
wiley +1 more source
Animal empathy reconsidered: a multidimensional profile account
ABSTRACT Empathy is the glue that holds societies together and yet several fundamental questions about empathy persist. What is empathy (the definitional question)? Is it uniquely human and, if not, which nonhuman animals possess empathy (the distribution question)? Which type or quality of empathy is realized in different species (the quality question)
Albert Newen +5 more
wiley +1 more source
The clique graph, K(G), of a graph G is the intersection graph of the maximal cliques of G. For a natural number n, a graph G is n-convergent if K-n(G) is isomorphic to ICI (the one-vertex graph).
Lucchesi, CL +2 more
core +2 more sources
Linear Clique-Width for Hereditary Classes of Cographs [PDF]
The class of cographs is known to have unbounded linear clique-width. We prove that a hereditary class of cographs has bounded linear clique-width if and only if it does not contain all quasi-threshold graphs or their complements. The proof borrows ideas
Vincent Vatter +5 more
core +1 more source
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
Distance signless Laplacian eigenvalues, diameter, and clique number [PDF]
Saleem Khan, Shariefuddin Pirzada
doaj +1 more source
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs [PDF]
Clique-Helly and hereditary clique-Helly graphs are polynomial-time recognizable. Recently, we presented a proof that the clique graph recognition problem is NP-complete [L. Alcón, L. Faria, C.M.H. de Figueiredo, M. Gutierrez, Clique graph recognition is
Faria, L. +3 more
core +1 more source

