Results 121 to 130 of about 69,865 (208)

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

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

Karmapala: Through The Forbidden Scenes

, 2023
George Clark & Bunga Siagian, UK/Indonesia, 2023-24, video, sound, 20min Karmapala: Through The Forbidden Scenes seeks to imagine an unmade film by Indonesian Leftist director Bachtiar Siagian (1923-2002) whose production was halted by the 1965 anti ...
Clark, G., Siagian, S.
core  

Planar graph coloring with forbidden subgraphs : why trees and paths are dangerous

, 2002
We consider the problem of coloring a planar graph with the minimum number of colors such that each color class avoids one or more forbidden graphs as subgraphs. We perform a detailed study of the computational complexity of this problem.
Penttonen, M., Woeginger, G.J., Fomin, F.V., Kratochvil, J., Broersma, H.J., Schmidt, E.M.   +5 more
core   +1 more source

Hybrid Optimization Algorithm Based on Double Particle Swarm in 3D NoC Mapping. [PDF]

Micromachines (Basel), 2023
Fang J, Cai H, Lv X.
europepmc   +1 more source

Kamapala Through The Forbidden Scenes

‘Kamapala Through The Forbidden Scenes‘ with Bunga Siagian in Widmann, Philip (Eds) ‘Film Undone.
Clark, G., Siagian, B.
core   +3 more sources

Does novel food differ in cultural contexts? A comparative analysis of Japanese and Singaporean cultural acceptance through text analysis of mass media. [PDF]

Curr Res Food Sci, 2023
Matsuoka H, Uchiyama Y, Woraitthinan K, Kohsaka R.   +3 more
europepmc   +1 more source

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

Algorithmica, 2022
Jelínek V, Klimošová T, Masařík T, Novotná J, Pokorná A.   +4 more
europepmc   +1 more source

Graph colourings with forbidden k-coloured subgraphs

, 2013
Click on the link to view the abstract.Keywords: Generalised colouring, forbidden subgraph, graph propertyQuaestiones Mathematicae 36(2013), 537 ...
Dorfling, Michael J, Dorfling, Samantha
core  

Fermat Principle, Ramsey Theory and Metamaterials. [PDF]

Materials (Basel), 2023
Frenkel M, Shoval S, Bormashenko E.
europepmc   +1 more source

Characterization and recognition of edge intersection graphs of trichromatic hypergraphs with finite multiplicity in the class of split graphs

Informatika, 2018
A hypergraph is called k-chromatic if its vertex set can be partitioned into at most k pairwise disjoint subsets when each subset has no more than two common vertices with every edge of the hypergraph.
T. V. Lubasheva
doaj