Results 111 to 120 of about 735 (221)

Characterization and recognition of edge intersection graphs of 3-chromatic hypergraphs with multiplicity at most than two in the class of split graphs

open access: yesЖурнал Белорусского государственного университета: Математика, информатика, 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  

Fermat Principle, Ramsey Theory and Metamaterials. [PDF]

open access: yesMaterials (Basel), 2023
Frenkel M, Shoval S, Bormashenko E.
europepmc   +1 more source

On 3-Coloring of ( 2 P 4 , C 5 )-Free Graphs. [PDF]

open access: yesAlgorithmica, 2022
Jelínek V   +4 more
europepmc   +1 more source

3-Colourability and Forbidden Subgraphs

open access: yesElectronic 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

Laboratory earthquakes decipher control and stability of rupture speeds. [PDF]

open access: yesNat Commun, 2023
Dong P   +4 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy