Results 181 to 190 of about 1,341 (220)
Some of the next articles are maybe not open access.
Cycle-perfect graphs are perfect
Journal of Graph Theory, 1996Given any graph \(G\), the cycle graph \(C(G)\) of \(G\) is defined by letting the vertices of \(C(G)\) be the induced cycles of \(G\); two induced cycles of \(G\) are adjacent in \(C(G)\) if they have in \(G\) at least one edge in common. \(G\) is called cycle-perfect if \(G\) and \(C(G)\) have no chordless cycles of odd length at least five.
openaire +3 more sources
Perfect lens with not so perfect boundaries
Optics Letters, 2009In manufacturing left-handed media the interfaces will never be perfect; defects and other disturbances to interfaces and material parameters are unavoidable. We report an analytical calculation of electromagnetic wave propagation through a perfect lens with diffuse boundaries.
P C, Ingrey +3 more
openaire +2 more sources
IEEE Transactions on Information Theory, 1993
Summary: Given positive integers \(r\), \(s\), \(u\), and \(v\), an \((r, s; u, v)\) perfect map is defined to be a periodic \(r\times s\) binary array in which every \(u\times v\) binary array appears exactly once as a periodic subarray. Perfect maps are the natural extension of the de Bruijn sequences to two dimensions.
openaire +1 more source
Summary: Given positive integers \(r\), \(s\), \(u\), and \(v\), an \((r, s; u, v)\) perfect map is defined to be a periodic \(r\times s\) binary array in which every \(u\times v\) binary array appears exactly once as a periodic subarray. Perfect maps are the natural extension of the de Bruijn sequences to two dimensions.
openaire +1 more source
A generalization of perfect graphs?i-perfect graphs
Journal of Graph Theory, 1996The \(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
Leizhen Cai, Derek G. Corneil
openaire +3 more sources
, 1988 Maimonides on Perfecting Perfection
Harvard Theological Review, 2017This article addresses two critical questions concerning Maimonides's views on human perfection at the end of hisGuide of the Perplexed. The first is: For those who have reached the highest category of perfection—intellectual perfection, apprehension of the divine, the divine science—what prescription does Maimonides offer for perfecting that ...
openaire +1 more source
Rank-perfect and" weakly rank-perfect graphs
Mathematical Methods of Operations Research (ZOR), 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
2000
We extend positive supercompilation to handle negative as well as positive information. This is done by instrumenting the underlying unfold rules with a small rewrite system that handles constraints on terms, thereby ensuring perfect information propagation.
Jens P. Secher, Morten Heine Sørensen
openaire +2 more sources
We extend positive supercompilation to handle negative as well as positive information. This is done by instrumenting the underlying unfold rules with a small rewrite system that handles constraints on terms, thereby ensuring perfect information propagation.
Jens P. Secher, Morten Heine Sørensen
openaire +2 more sources