Results 111 to 120 of about 735 (221)
Hybrid Optimization Algorithm Based on Double Particle Swarm in 3D NoC Mapping. [PDF]
Fang J, Cai H, Lv X.
europepmc +1 more source
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
Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs [PDF]
Maria Axenovich +2 more
openalex +1 more source
Fermat Principle, Ramsey Theory and Metamaterials. [PDF]
Frenkel M, Shoval S, Bormashenko E.
europepmc +1 more source
On 3-Coloring of ( 2 P 4 , C 5 )-Free Graphs. [PDF]
Jelínek V +4 more
europepmc +1 more source
The maximum signless Laplacian spectral radius of graphs with forbidden subgraphs
Dandan Chen, Xiaoling Ma
openalex +2 more sources
3-Colourability and Forbidden Subgraphs
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
Forbidden rainbow subgraphs that force large monochromatic or multicolored k-connected subgraphs [PDF]
Xihe Li, Ligong Wang
openalex +1 more source
Laboratory earthquakes decipher control and stability of rupture speeds. [PDF]
Dong P +4 more
europepmc +1 more source

