Discrete Appl. Math. 271 (2019) 144–151. Axenovich ... Polychromatic colorings of complete graphs with respect to 1-, 2-factors and Hamiltonian cycles. J Graph Theory 87 (2018) 660–671. Kaylor, L. and ...

ABSTRACT: We consider the problem of graphs characterization by its matching polynomial. In the paper, we show that P m ∪T( 1,3,n ) are determined by its matching polynomial iff m is even or 3 and n≠3 ...

You can create a release to package software, along with release notes and links to binary files, for other people to use. Learn more about releases in our docs.

O SINARC é uma ferramenta de OSINT, em fase experimental, que realiza análise de dados exploratória sobre a base de dados pública de CNPJ da Receita Federal a partir de uma abordagem metodológica ...

ABSTRACT: In this paper, we consider chessboard graphs in higher dimensions and the number of edges of their corresponding graphs. First, we solve for the number of edges for some of the chessboard ...

To overcome these limitations, a novel image segmentation method that integrates nonlocal criteria with graph cut theory is proposed. Initially, the method transforms the image’s color space to the ...

It looks like you're using an old browser. To access all of the content on Yr, we recommend that you update your browser. It looks like JavaScript is disabled in your browser. To access all the ...

Computational complexity, originated from the interactions between computer science and numerical optimization, is one of the major theories that have revolutionized the approach to solving ...

The RIT physics master's program offers robust, advanced training in a flexible format that allows you to meet your personal career goals. What makes an RIT science and math education exceptional?