نتایج جستجو برای: spectral characterization

تعداد نتایج: 532099  

Journal: :Proceedings of the American Mathematical Society 1984

Journal: :Journal für die reine und angewandte Mathematik (Crelles Journal) 2019

Journal: :CoRR 2015
Dmitriy S. Malyshev

We completely determine the complexity status of the dominating set problem for hereditary graph classes defined by forbidden induced subgraphs with at most five vertices.

Journal: :Discrete Mathematics & Theoretical Computer Science 2000
Elena Barcucci Alberto Del Lungo Elisa Pergola Renzo Pinzani

A permutation is said to be –avoiding if it does not contain any subsequence having all the same pairwise comparisons as . This paper concerns the characterization and enumeration of permutations which avoid a set of subsequences increasing both in number and in length at the same time. Let be the set of subsequences of the form “ ”, being any permutation on . For ! the only subsequence in #" i...

Journal: :Discrete Mathematics 2015
Dmitriy S. Malyshev

We completely determine the complexity status of the 3-colorability problem for hereditary graph classes defined by two forbidden induced subgraphs with at most five vertices. © 2015 Elsevier B.V. All rights reserved.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید