Results 111 to 120 of about 772 (221)
Forbidden Subgraphs for Graphs of Bounded Spectral Radius, with Applications to Equiangular Lines [PDF]
, 2020 Zilin Jiang, Alexandr Polyanskii
openalex +1 more source
Журнал Белорусского государственного университета: Математика, информатика, 2018 Let Lm(k) denote the class of edge intersection graphs of k-chromatic hypergraphs with multiplicity at most m. It is known that the problem of recognizing graphs from L1(k) is polynomially solvable if k = 2 and is NP-complete if k = 3.
Tatiana V. Lubasheva, Yury M. Metelsky
doaj
Forbidden induced subgraphs for graphs and signed graphs with eigenvalues bounded from below [PDF]
, 2021 Zilin Jiang, Alexandr Polyanskii
openalex +1 more source
On 3-Coloring of ( 2 P 4 , C 5 )-Free Graphs. [PDF]
Algorithmica, 2022 Jelínek V +4 more
europepmc +1 more source
Fermat Principle, Ramsey Theory and Metamaterials. [PDF]
Materials (Basel), 2023 Frenkel M, Shoval S, Bormashenko E.
europepmc +1 more source
Hadwiger's Conjecture with Certain Forbidden Induced Subgraphs [PDF]
, 2022 Daniel Carter
openalex +1 more source
On Forbidden Subgraphs of (K2, H)-Sim-(Super)Magic Graphs [PDF]
, 2021 Yeva Fadhilah Ashari +2 more
openalex +1 more source
3-Colourability and Forbidden Subgraphs
Electronic Notes in Discrete Mathematics, 2000 Abstract In this paper we investigate the chromatic aspects for graphs with forbidden induced subgraphs with emphasis on the question of 3-colourability. In the main part all possible pairs (A, B) of forbidden induced subgraphs, s.t. every A- and B -free graph is 3-colourable, are determined.
openaire +1 more source
Helly $\mathbf{EPT}$ graphs on bounded degree trees: forbidden induced subgraphs and efficient recognition [PDF]
, 2016 Liliana Alcón +2 more
openalex +1 more source