Results 281 to 290 of about 520,977 (330)

Disjoint Perfect Secure Domination in the Join and Corona of Graphs

Renelyn B. Udtohan -, Enrico L. Enriquez
openalex   +1 more source

From prompt engineering to agent engineering: expanding the AI toolbox with autonomous agentic AI collaborators for biomedical discovery. [PDF]

BioData Min
Moore JH, Tatonetti NP.
europepmc   +1 more source

Enumeration of perfect matchings of graphs with rotational symmetry by Pfaffians

, 2006
Weigen Yan, Yeong‐Nan Yeh, Fuji Zhang
openalex   +1 more source

The impact of seasonal temperature and water transport on the growth of sunshine rose grapevines and precision irrigation strategies. [PDF]

Front Plant Sci
Wang R, Han Z, Li Y, Shang S, Li B, Lu X.   +5 more
europepmc   +1 more source

CharMark: character-level Markov modeling for interpretable linguistic biomarkers of cognitive decline. [PDF]

Front Digit Health
Mekulu K, Aqlan F, Yang H.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

?-Perfect graphs

Cybernetics, 1990
The idea of an \(\omega\)-perfect graph is introduced. Several classes of \(\omega\)-perfect graphs are described, but the question of describing the whole class of \(\omega\)-perfect graphs is not clear yet. A vertex colouring algorithm is suggested for graphs which contain an odd number of holes, where the number of colours used does not exceed the ...
S. E. Markosyan, G. S. Gasparyan
openaire   +3 more sources

A generalization of perfect graphs?i-perfect graphs

Journal of Graph Theory, 1996
The \(i\)-chromatic number of \(G\), denoted \(\chi_i(G)\), is the least number \(k\) such that there is a \(k\)-colouring with no colour class inducing a \(K_{i+1}\) as a subgraph. The \(i\)-clique number, \(\omega_i(G)\), is defined to be \(\lceil \omega(G)/i\rceil\). An induced subgraph \(H\) of \(G\) is an \(i\)-transversal iff \(\omega(H)= i\) and
Cai, Leizhen, Corneil, Derek
openaire   +2 more sources