Results 21 to 30 of about 1,131,712 (268)

Application of decision diagrams of incompletely specified of k-valued logic functions in the synthesis of logical circuits

Informatika, 2023
Objectives. The problem of circuit implementation of incompletely specified (partial) k-valued logic functions given by tabular representations is considered.
P. N. Bibilo
doaj   +1 more source

Bis(terpyridine) Iron(II) Functionalized Vertically-Oriented Nanostructured Silica Films: Toward Electrochromic Materials

Frontiers in Chemistry, 2020
Recent and potential applications of electrochromic materials include smart windows, optoelectronic devices, and energy conversion. In this study, we have incorporated bis(terpyridine) iron (II) complexes into vertically-oriented silica thin films ...
Neus Vilà, Alain Walcarius
doaj   +1 more source

Mapping forest fire severity using bi-temporal unmixing of Sentinel-2 data - Towards a quantitative understanding of fire impacts

Science of Remote Sensing, 2023
Precise quantification of forest fire impacts is critical for management strategies in support of post-fire mitigation. In this regard, optical remote sensing imagery in combination with spectral unmixing has been widely used to measure fire severity by ...
Kira Anjana Pfoch, Dirk Pflugmacher, Akpona Okujeni, Patrick Hostert   +3 more
doaj   +1 more source

On edge orienting methods for graph coloring [PDF]

Journal of Combinatorial Optimization, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bernard Gendron, Alain Hertz, Patrick St-Louis   +2 more
openaire   +2 more sources

Oriented Chromatic Number of Cartesian Products and Strong Products of Paths

Discussiones Mathematicae Graph Theory, 2019
An oriented coloring of an oriented graph G is a homomorphism from G to H such that H is without selfloops and arcs in opposite directions. We shall say that H is a coloring graph.
Dybizbański Janusz, Nenca Anna
doaj   +1 more source

Oriented colorings of partial 2-trees [PDF]

Information Processing Letters, 2008
A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping f from V(G) to V(H), that is f(x)f(y) is an arc in H whenever xy is an arc in G. The oriented chromatic number of G is the minimum order of an oriented graph H such that G has a homomorphism to H.
Ochem, Pascal, Pinlou, Alexandre
openaire   +1 more source

The benefits of coloring pages for Varityskuvat

, 2022
Coloring makes adults feel like a child again and takes them back to the happiest and most carefree period of their lives. Remembering some of these moments helps us relax and be more optimistic about the future.
Jones Andrew
core   +1 more source

On the balanced case of the Brualdi-Shen conjecture on 4-cycle decompositions of Eulerian bipartite tournaments

Electronic Journal of Graph Theory and Applications, 2015
The Brualdi-Shen Conjecture on Eulerian Bipartite Tournaments states that any such graph can be decomposed into oriented 4-cycles. In this article we prove the balanced case of the mentioned conjecture. We show that for any $2n\times 2n$ bipartite graph $
Rafael Del Valle Vega
doaj   +1 more source

Colorings and Orientations of Matrices and Graphs [PDF]

The Electronic Journal of Combinatorics, 2006
We introduce colorings and orientations of matrices as generalizations of the graph theoretic terms. The permanent per$(A[\zeta|\xi])$ of certain copies $A[\zeta|\xi]$ of a matrix $A$ can be expressed as a weighted sum over the orientations or the colorings of $A$.
openaire   +3 more sources

On colorings and orientations of signed graphs

Discrete Mathematics Letters, 2023
Summary: A classical theorem independently due to \textit{T. Gallai} [in: Theory of Graphs, Proc. Colloq. Tihany, Hungary 1966, 115--118 (1968; Zbl 0159.54403)] and \textit{B. Roy} [Rev. Franç. Inform. Rech. Opér. 1, No. 5, 129--132 (1967; Zbl 0157.31302)] states that a graph \(G\) has a proper \(k\)-coloring if and only if \(G\) has an orientation ...
openaire   +5 more sources